Abstract
The paper studies resolved systems of language equations that allow the use of all Boolean operations in addition to concatenation. Existence and uniqueness of solutions are shown to be their nontrivial properties, these properties are given characterizations by first order formulae, and the position of the corresponding decision problems in the arithmetical hierarchy is determined. The class of languages defined by components of unique solutions of such systems is shown to coincide with the class of recursive languages.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Autebert, J. Berstel and L. Boasson, “Context-Free Languages and Pushdown Automata”, Handbook of Formal Languages, Vol. 1, 111–174, Springer-Verlag, Berlin, 1997.
N. Immerman, Descriptive complexity, Springer-Verlag, New York, 1998.
W. Kuich, “Semirings and Formal Power Series: Their Relevance to Formal Language and Automata”, Handbook of Formal Languages, Vol. 1, 609–677, Springer-Verlag, Berlin, 1997.
E._L. Leiss, Language equations, Springer-Verlag, New York, 1999.
A. Okhotin, “Conjunctive grammars”, Journal of Automata, Languages and Combinatorics, 6:4 (2001), 519–535.
A. Okhotin, “Conjunctive grammars and systems of language equations”, Programming and Computer Software, 28:5 (2002) 243–249.
Ch. H. Papadimitriou, Computational complexity, Addison-Wesley, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okhotin, A. (2003). Decision Problems for Language Equations with Boolean Operations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_21
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive