Abstract
Systems of language equations of the form {ϕ(X 1, ..., X n ) = ∅, ψ(X 1, ..., X n )≠∅} are studied, where ϕ,ψ may contain set-theoretic operations and concatenation; they can be equivalently represented as strict inequalities ξ(X 1, ..., X n ) ⊂ L 0. It is proved that the problem whether such an inequality has a solution is Σ2-complete, the problem whether it has a unique solution is in (Σ3 ∩ Π3) ∖ (Σ2 ∪ Π2), the existence of a regular solution is a Σ1-complete problem, while testing whether there are finitely many solutions is Σ3-complete. The class of languages representable by their unique solutions is exactly the class of recursive sets, though a decision procedure cannot be algorithmically constructed out of an inequality, even if a proof of solution uniqueness is attached.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baader, F., Narendran, P.: Unification of concept terms in description logic. Journal of Symbolic Computation 31, 277–305 (2001)
Baader, F., Küsters, R.: Unification in a description logic with transitive closure of roles. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 217–232. Springer, Heidelberg (2001)
Brzozowski, J.A., Leiss, E.L.: On equations for regular languages, finite automata, and sequential networks. Theoretical Computer Science 10, 19–35 (1980)
Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)
Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. Journal of the ACM 9, 350–371 (1962)
Hartmanis, J.: Context-free languages and Turing machine computations. In: Proceedings of Symposia in Applied Mathematics, vol. 19, pp. 42–51. AMS, Providence (1967)
Karhumäki, J., Petre, I.: Two problems on commutation of languages. In: Păun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: The Challenge of the New Century, vol. 2, pp. 477–494. World Scientific, Singapore (2004)
Kunc, M.: Regular solutions of language inequalities and well quasi-orders. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 870–881. Springer, Heidelberg (2004)
Kunc, M.: The power of commuting with finite sets of words. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 569–580. Springer, Heidelberg (2005)
Kunc, M.: Largest solutions of left-linear language inequalities. In: AFL 2005 (2005)
Okhotin, A.: Conjunctive grammars and systems of language equations. Programming and Computer Software 28, 243–249 (2002)
Okhotin, A.: Decision problems for language equations with Boolean operations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 239–251. Springer, Heidelberg (2003)
Okhotin, A.: Boolean grammars. Information and Computation 194(1), 19–48 (2004)
Okhotin, A.: The dual of concatenation. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 698–710. Springer, Heidelberg (2004)
Okhotin, A.: On computational universality in language equations. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 292–303. Springer, Heidelberg (2005)
Okhotin, A.: A characterization of the arithmetical hierarchy by language equations. In: DCFS 2004, London, Ontario, Canada, pp. 225–237.
Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
Salomaa, A.: Theory of Automata. Pergamon Press, Oxford (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okhotin, A. (2005). Strict Language Inequalities and Their Decision Problems. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_61
Download citation
DOI: https://doi.org/10.1007/11549345_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28702-5
Online ISBN: 978-3-540-31867-5
eBook Packages: Computer ScienceComputer Science (R0)