Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
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)
Conjunctive Grammars and Systems of Language Equations
Programming and Computing Software
Automaton representation of linear conjunctive languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Whale calf, a parser generator for conjunctive grammars
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Decision problems for language equations with Boolean operations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
As a direct continuation of the earlier research on conjunctive grammars - context-free grammars equipped with intersection - this paper introduces a new class of formal grammars, which allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous semantics for such grammars is defined by language equations in a way that allows to generalize some techniques from the theory of context-free grammars, including Chomsky normal form, Cocke-Kasami-Younger recognition algorithm and some limited extension of the notion of a parse tree, which together allow to conjecture the practical applicability of the new concept.