Abstract
We investigate the solvability of the equivalence problem in various subclasses of the class of context-free languages. Another fundamental problem necessary for the material in this paper is also the special binary relation for a set of finite languages. Combining these two topics, we obtain in this paper the necessary and sufficient conditions for the equality of two bracketed languages for the prefix-and-suffix case.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have