Comparing linear conjunctive languages to subfamilies of the context-free languages

Authors:
Alexander Okhotin
Affiliations:
Department of Mathematics, University of Turku, Academy of Finland, Turku, Finland
Venue:
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Year:
2011

Citing 11
Cited 2

On real time one-way cellular array

Theoretical Computer Science
Parenthesis Grammars

Journal of the ACM (JACM)
Conjunctive grammars

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Balanced grammars and their languages

Formal and natural computing
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Boolean grammars

Information and Computation
Unambiguous Boolean grammars

Information and Computation
A Game-Theoretic Characterization of Boolean Grammars

DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

Theory of Computing Systems - Special Issue: Symposium on Computer Science, Guest Editors: Sergei Artemov, Volker Diekert and Dima Grigoriev
Conjunctive grammars with restricted disjunction

Theoretical Computer Science
Fast parsing for Boolean grammars: a generalization of Valiant's algorithm

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Descriptional complexity of unambiguous nested word automata

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State complexity of operations on input-driven pushdown automata

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science

Quantified Score

Hi-index	0.00

Visualization

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.