Theoretical studies in computer science
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM (JACM)
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)
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages
Gesellschaft für Informatik e.V., 3. Jahrestagung
Recursive descent parsing for Boolean grammars
Acta Informatica
Information and Computation
Simple deterministic languages
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
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
Comparing linear conjunctive languages to subfamilies of the context-free languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Language equations with complementation: Expressive power
Theoretical Computer Science
Defining contexts in context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
| Hi-index | 5.23 |
It is shown that every conjunctive language is generated by a conjunctive grammar from a special subclass, in which every nonterminal A has at most one rule of the general form A-@a"1&...&@a"n, while the rest of the rules for A must be of the type A-w, where w is a terminal string. For context-free grammars, a similar property does not hold (S.A. Greibach et al. (1992) [3]). If it is furthermore required that each rule A-w has a nonempty w, then a substantial subfamily of conjunctive languages can be generated, yet it remains unknown whether such grammars are as powerful as conjunctive grammars of the general form.