- Titel
- On Language Equations with One-sided Concatenation
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-793473
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 06-01
- Erstveröffentlichung
- 2006
- DOI
- https://doi.org/10.25368/2022.154
- Abstract (EN)
- Language equations are equations where both the constants occurring in the equations and the solutions are formal languages. They have first been introduced in formal language theory, but are now also considered in other areas of computer science. In the present paper, we restrict the attention to language equations with one-sided concatenation, but in contrast to previous work on these equations, we allow not just union but all Boolean operations to be used when formulating them. In addition, we are not just interested in deciding solvability of such equations, but also in deciding other properties of the set of solutions, like its cardinality (finite, infinite, uncountable) and whether it contains least/greatest solutions. We show that all these decision problems are ExpTime-complete.
- This report has also appeared as TUCS Technical Report, Turku Centre for Computer Science, University of Turku, Finland.
- Freie Schlagwörter (DE)
- Konkatenation, Sprachgleichung, Beschreibungslogik
- Freie Schlagwörter (EN)
- concatenation, language equation, description logic
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Publizierende Institution
- Technische Universität Dresden, Dresden
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-793473
- Veröffentlichungsdatum Qucosa
- 16.06.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0