On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars

It is demonstrated that the family of languages generated by unambiguous conjunctive grammars with 1 nonterminal symbol is strictly included in the languages generated by 2-nonterminal grammars, which is in turn a proper subset of the family generated using 3 or more nonterminal symbols. This hierarchy is established by considering grammars over a one-letter alphabet, for which it is shown that 1-nonterminal grammars generate only regular languages, 2-nonterminal grammars generate some non-regular languages, but all of them have upper density zero, while 3-nonterminal grammars may generate some non-regular languages of non-zero density. It is also shown that the equivalence problem for 2-nonterminal grammars is undecidable.

[1]  Alexander Okhotin.  Unambiguous Boolean grammars , 2007, Inf. Comput..

[2]  Alexander Okhotin,et al.  Conjunctive Grammars , 2001, J. Autom. Lang. Comb..

[3]  J. Shallit,et al.  Automatic Sequences: Contents , 2003 .

[4]  Artur Jez,et al.  One-Nonterminal Conjunctive Grammars over a Unary Alphabet , 2011, Theory of Computing Systems.

[5]  Alexander Okhotin,et al.  On the equivalence of linear conjunctive grammars and trellis automata , 2004, RAIRO Theor. Informatics Appl..

[6]  Artur Jez.  Conjunctive Grammars Can Generate Non-regular Unary Languages , 2007, Developments in Language Theory.

[7]  Alexander Okhotin,et al.  On the expressive power of univariate equations over sets of natural numbers , 2012, Inf. Comput..

[8]  Artur Jez,et al.  Complexity of Equations over Sets of Natural Numbers , 2009, Theory of Computing Systems.

[9]  Jeffrey Shallit,et al.  Automatic Sequences by Jean-Paul Allouche , 2003 .

[10]  Jozef Gruska.  Descriptional Complexity of Context-Free Languages , 1973, MFCS.

[11]  Artur Jez,et al.  Unambiguous Conjunctive Grammars over a One-Letter Alphabet , 2013, Developments in Language Theory.

[12]  Artur Jez,et al.  Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth , 2008, Theory of Computing Systems.

[13]  Alexander Okhotin.  Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm , 2010, Developments in Language Theory.

[14]  Arto Salomaa,et al.  Systolic trellis automatat , 1984 .

[15]  Charles R. Dyer,et al.  One-Way Bounded Cellular Automata , 1980, Inf. Control..

[16]  Jeffrey Shallit,et al.  Automatic Sequences: Theory, Applications, Generalizations , 2003 .

[17]  Alexander Okhotin,et al.  Parsing Unary Boolean Grammars Using Online Convolution , 2010, Advances and Applications of Automata on Words and Trees.

[18]  Alexander Okhotin,et al.  On the number of nonterminals in linear conjunctive grammars , 2004, Theor. Comput. Sci..