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
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)
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
On the closure properties of linear conjunctive languages
Theoretical Computer Science
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
Information and Computation
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
Homomorphisms preserving linear conjunctive languages
Journal of Automata, Languages and Combinatorics
Information and Computation
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Decision problems for language equations with Boolean operations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
A simple P-complete problem and its representations by language equations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Least and greatest solutions of equations over sets of integers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Univariate Equations Over Sets of Natural Numbers
Fundamenta Informaticae
Language equations with symmetric difference
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Strict language inequalities and their decision problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On computational universality in language equations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
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
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Language Equations with Symmetric Difference
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Conjunctive grammars over a unary alphabet: undecidability and unbounded growth
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
This paper studies systems of language equations that are resolved with respect to variables and contain the operations of concatenation, union and intersection. Every system of this kind is proved to have a least fixed point, and the equivalence of these systems to conjunctive grammars is established. This allows us to obtain an algebraic characterization of the language family generated by conjunctive grammars.