|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 7 of 22 found articles
| Title: |
Language Equations with Symmetric Difference |
| Author: |
Okhotin, Alexander |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 116 (2012) nr. 1-4 pages 205-222 |
| Year: |
2012-05-16 |
| Contents: |
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 Π01-complete, the existence of a unique, a least or a greatest solution is Π02-complete, while the existence of finitely many solutions is Π03-complete. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 7 of 22 found articles
| << previous | next >> |