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
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
Information and Computation
Theoretical Computer Science - Mathematical foundations of computer science 2004
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
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
On the Computational Completeness of Equations over Sets of Natural Numbers
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Information and Computation
Complex Algebras of Arithmetic
Fundamenta Informaticae
DLT'03 Proceedings of the 7th international conference on Developments in language theory
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
Language equations with symmetric difference
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On language inequalities XK ⊆ LX
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
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
Complex Algebras of Arithmetic
Fundamenta Informaticae
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
| Hi-index | 0.00 |
The paper studies resolved systems of language equations that allow the use of all Boolean operations in addition to concatenation. Existence and uniqueness of solutions are shown to be their nontrivial properties, these properties are given characterizations by first order formulae, and the position of the corresponding decision problems in the arithmetical hierarchy is determined. The class of languages defined by components of unique solutions of such systems is shown to coincide with the class of recursive languages.