Language Equations with Symmetric Difference

Authors:
Alexander Okhotin
Affiliations:
(Correspd.) Department of Mathematics, University of Turku, Turku FI-20014, Finland, alexander.okhotin@utu.fi
Venue:
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Year:
2012

Citing 21
Cited 0

Context-free languages and pushdown automata

Handbook of formal languages, vol. 1
Two Families of Languages Related to ALGOL

Journal of the ACM (JACM)
Conjunctive Grammars and Systems of Language Equations

Programming and Computing Software
Valid identity problem for shuffle regular expressions

Journal of Automata, Languages and Combinatorics
Unification in a Description Logic with Transitive Closure of Roles

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Boolean grammars

Information and Computation
The dual of concatenation

Theoretical Computer Science - Mathematical foundations of computer science 2004
Regular solutions of language inequalities and well quasi-orders

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Unresolved systems of language equations: expressive power and decision problems

Theoretical Computer Science
Language equations with complementation: Decision problems

Theoretical Computer Science
The Power of Commuting with Finite Sets of Words

Theory of Computing Systems
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
Simple deterministic languages

SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

Theory of Computing Systems - Special Issue: Symposium on Computer Science, Guest Editors: Sergei Artemov, Volker Diekert and Dima Grigoriev
Reversal-bounded multipushdown machines

Journal of Computer and System Sciences
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
Schema design for XML repositories: complexity and tractability

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Language equations with complementation: Expressive power

Theoretical Computer Science
Strict language inequalities and their decision problems

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper investigates the expressive power of language equations with the operations of concatenation and symmetric difference. For equations over every finite alphabet Σ with |Σ| ≥ 1, it is demonstrated that the sets representable by unique solutions of such equations are exactly the recursive sets over Σ, and the sets representable by their least (greatest) solutions are exactly the recursively enumerable sets (their complements, respectively). If |_| ≥ 2, the same characterization holds already for equations using symmetric difference and linear concatenation with regular constants. In both cases, the solution existence problem is &Pgr;01-complete, the existence of a unique, a least or a greatest solution is &Pgr;02-complete, while the existence of finitely many solutions is &Pgr;03-complete.