Unrestricted complementation in language equations over a one-letter alphabet
Theoretical Computer Science
Maximal and minimal solutions to language equations
Journal of Computer and System Sciences
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Set constraints in some equational theories
Information and Computation
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Unification of concept terms in description logics
Journal of Symbolic Computation
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)
Theory of Automata
Conjunctive Grammars and Systems of Language Equations
Programming and Computing Software
Solution of parallel language equations for logic synthesis
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Conway's problem for three-word sets
Theoretical Computer Science
The Complexity of Set Constraints
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Closure and decidability properties of some language classes with respect to ciliate bio-operations
Theoretical Computer Science
Information and Computation
Language equations, maximality and error-detection
Journal of Computer and System Sciences
Reversal-bounded multipushdown machines
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
On language equations XXK = XXL and XM = N over a unary alphabet
DLT'10 Proceedings of the 14th international conference on Developments in language theory
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
On language decompositions and primality
Rainbow of computer science
Language equations with complementation: Expressive power
Theoretical Computer Science
On the expressive power of univariate equations over sets of natural numbers
Information and Computation
Equations x+a=b and (x+x)+c=(x−x)+d over sets of natural numbers
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
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 |
Equations with formal languages as unknowns using all Boolean operations and concatenation are studied. Their main properties, such as solution existence and uniqueness, are characterized by first-order formulae. It is shown that testing solution existence is @P"1-complete, while solution uniqueness and existence of a least and of a greatest solution are all @P"2-complete problems. The families of languages defined by components of unique, least and greatest solutions of such systems are shown to coincide with the classes of recursive, recursively enumerable and co-recursively enumerable sets, respectively.