Language equations with complementation: Decision problems

Authors:
Alexander Okhotin;Oksana Yakimova
Affiliations:
Academy of Finland, Vilhonvuorenkatu 6, Helsinki, FIN-00501, Finland and Department of Mathematics, University of Turku, Yliopistonmäki, Turku, FIN-20014, Finland;Max-Planck-Institut für Mathematik, Vivatsgasse 7, Bonn D-53111, Germany
Venue:
Theoretical Computer Science
Year:
2007

Unrestricted complementation in language equations over a one-letter alphabet

Theoretical Computer Science
Semirings and formal power series: their relevance to formal languages and 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
On the state complexity of k-entry deterministic finite automata

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

Theory of Automata
Conjunctive Grammars and Systems of Language Equations

Programming and Computing Software
Boolean grammars

Information and Computation
The dual of concatenation

Theoretical Computer Science - Mathematical foundations of computer science 2004
Unresolved systems of language equations: expressive power and decision problems

Theoretical Computer Science
On language inequalities XK ⊆ LX

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
The power of commuting with finite sets of words

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

What do we know about language equations?

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Language equations with complementation: Expressive power

Theoretical Computer Science
On the expressive power of univariate equations over sets of natural numbers

Information and Computation
Language Equations with Symmetric Difference

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju

Hi-index	5.23

Systems of language equations of the form X"i=@f"i(X"1,...,X"n)(1=