Abstract
Linear conjunctive grammars define the same family of languages as one-way real-time cellular automata (Okhotin, "On the equivalence of linear conjunctive grammars to trellis automata", RAIRO ITA, 2004), and this family is known to be incomparable to the context-free languages (Terrier, "On real-time one-way cellular array", Theoret. Comput. Sci., 1995). This paper investigates subclasses of the context-free languages for possible containment in this class. It is shown that every visibly pushdown automaton (Alur, Madhusudan, "Visibly pushdown languages", STOC 2004) can be simulated by a one-way real-time cellular automaton, but already for LL(1) context-free languages and for one-counter DPDAs no simulation is possible. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Okhotin, A. (2011). Comparing linear conjunctive languages to subfamilies of the context-free languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6543 LNCS, pp. 431–443). https://doi.org/10.1007/978-3-642-18381-2_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
