Abstract
On the one hand, the inclusion problem for nonerasing and erasing pattern languages is undecidable; see [JSSY95]. On the other hand, the language equivalence problem for NE-pattern languages is trivially decidable (see [Ang80a]) but the question of whether the same holds for E-pattern languages is still open. It has been conjectured by Jiang et al. [JSSY95] that the language equivalence problem for E-pattern languages is also decidable. In this paper, we introduce a new normal form for patterns and show, using the normal form, that the language equivalence problem for E-pattern languages is decidable in many special cases. We conjecture that our normal form procedure decides the problem in the general case, too. If the conjecture holds true, then the normal form is the shortest pattern generating a given E-pattern language.KeywordsNormal FormEquivalence ProblemTerminal SegmentInclusion ProblemPattern LanguageThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
