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.
KeywordsRegular Language Input Alphabet Nonterminal Symbol Unary Language Language Equation
Unable to display preview. Download preview PDF.
- 1.Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press (2003)Google Scholar
- 2.Baader, F., Okhotin, A.: Complexity of language equations with one-sided concatenation and all Boolean operations. In: 20th International Workshop on Unification, UNIF 2006, Seattle, USA, August 11, pp. 59–73 (2006)Google Scholar
- 4.Dyer, C.: One-way bounded cellular automata. Information and Control 44, 261–281 (1980)Google Scholar
- 5.Gruska, J.: Descriptional complexity of context-free languages. In: Mathematical Foundations of Computer Science, MFCS 1973, Strbské Pleso, High Tatras, Czechoslovakia, September 3-8, pp. 71–83 (1973)Google Scholar
- 10.Jeż, A., Okhotin, A.: Unambiguous conjunctive grammars over a one-letter alphabet. TUCS Technical Report 1043, Turku Centre for Computer Science (submitted for publication, April 2012)Google Scholar
- 16.Okhotin, A., Reitwießner, C.: Parsing unary Boolean grammars using online convolution. In: Advances and Applications of Automata on Words and Trees (Dagstuhl seminar 10501), December 12-17 (2010)Google Scholar