On real-time cellular automata and trellis automata
Acta Informatica
Systolic Trellis automata: stability, decidability and complexity
Information and Control
LFP: a logic for linguistic descriptions and an analysis of its complexity
Computational Linguistics
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Unrestricted complementation in language equations over a one-letter alphabet
Theoretical Computer Science
The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
On real time one-way cellular array
Theoretical Computer Science
Handbook of formal languages, vol. 1
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Semirings and formal power series: their relevance to formal languages and automata
Handbook of formal languages, vol. 1
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
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)
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Conjunctive Grammars and Systems of Language Equations
Programming and Computing Software
On the closure properties of linear conjunctive languages
Theoretical Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
General context-free recognition in less than cubic time
Journal of Computer and System Sciences
Journal of Computer and System Sciences
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
Hi-index | 0.00 |
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous semantics for these 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 cubic-time recognition algorithm and some limited extension of the notion of a parse tree, which together allow to conjecture practical applicability of the new concept.