On Language Equations with One-sided Concatenation
Titel:
On Language Equations with One-sided Concatenation
Auteur:
Baader, Franz Okhotin, Alexander
Verschenen in:
Fundamenta informaticae
Paginering:
Jaargang 126 (2013) nr. 1 pagina's 1-35
Jaar:
2013-10-07
Inhoud:
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.
Tijdschrift beschrijving