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
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
Decidability of trajectory-based equations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Theoretical Computer Science - Mathematical foundations of computer science 2004
Unresolved systems of language equations: expressive power and decision problems
Theoretical Computer Science
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Language equations with complementation: Decision problems
Theoretical Computer Science
Lower bound technique for length-reducing automata
Information and Computation
Locally stratified Boolean grammars
Information and Computation
Information and Computation
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Well-founded semantics for Boolean grammars
Information and Computation
Homomorphisms preserving linear conjunctive languages
Journal of Automata, Languages and Combinatorics
Decision problems for language equations
Journal of Computer and System Sciences
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Conjunctive grammars can generate non-regular unary languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
A simple P-complete problem and its representations by language equations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
DLT'10 Proceedings of the 14th international conference on Developments in language theory
A simple P-complete problem and its language-theoretic representations
Theoretical Computer Science
A game-theoretic characterization of Boolean grammars
Theoretical Computer Science
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
Formal language constrained reachability and model checking propositional dynamic logics
RP'11 Proceedings of the 5th international conference on Reachability problems
Language equations with symmetric difference
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Language equations with complementation: Expressive power
Theoretical Computer Science
LR parsing for boolean grammars
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Strict language inequalities and their decision problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Well-Founded semantics for boolean grammars
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The boolean closure of growing context-sensitive languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Language equations with complementation
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Defining contexts in context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Parsing Boolean grammars over a one-letter alphabet using online convolution
Theoretical Computer Science
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
Language Equations with Symmetric Difference
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Expressive power of LL(k) Boolean grammars
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Parsing by matrix multiplication generalized to Boolean grammars
Theoretical Computer Science
| Hi-index | 0.01 |
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.