Skip to main content
SpringerLink
Log in

On Decidability of Theories of Regular Languages

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

This paper is dedicated to studying decidability properties of theories of regular languages with classical operations: union, concatenation, and the Kleene star. The theory with union only is a theory of some Boolean algebra, so it is decidable. We prove that the theory of regular languages with the Kleene star only is decidable. If we use union and concatenation simultaneously, then the theory becomes both Σ1- and π1-hard over the one-symbol alphabet. Using methods from the proof of this theorem we establish that the theory of regular languages over one-symbol alphabet with union and the Kleene star is as hard as arithmetic. Then we establish that the theory with all three operations is reducible to arithmetic also, hence, it is equivalent to arithmetic. Finally, we prove that the theory of regular languages over any alphabet with concatenation only is equivalent to arithmetic also. The last result is based on our previous work where an analogous theorem was proved for one-symbol languages.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling. Volume 1: parsing. Englewood cliffs, NJ: Prentice-Hall inc (1972)

  2. Allouche, J., Shallit, J.: Automatic sequences: theory, applications, generalizations. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

  3. Boolos, G.S., Burgess, J.P., Jeffrey, R.C.: Computability and Logic, 5th edn. Cambridge University Press, New York (2007)

    Book  Google Scholar 

  4. Dudakov, S.M.: On undecidability of concatenation theory for one-symbol languages. Lobachevskii J. Math. 41(2), 168–175 (2020)

    Article  MathSciNet  Google Scholar 

  5. Dudakov, S., Karlov, B.: On decidability of regular languages theories. In: Van Bevern, R., Kucherov, G (eds.) Computer Science — Theory and Applications. CSR 2019. Lecture notes in computer science, vol. 11532, pp 119–130 (2019)

  6. Grzegorczyk, A.: Undecidability without arithmetization. Stud. Logica. 79(2), 163–230 (2005)

    Article  MathSciNet  Google Scholar 

  7. Grzegorczyk, A., Zdanowski, K.: Undecidability and Concatenation. In: Ehrenfeucht, A., Marek, V. W., Srebrny, M (eds.) Andrzej Mostowski and Foundational Studies, pp 72–91. IOS Press, Amsterdam (2008)

  8. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Pearson, Harlow, Essex (2013)

    MATH  Google Scholar 

  9. Karlov, B.N.: On regular languages theory with Kleene star operation (in Russian). In: Proceedings of International Conference Algebra and Mathematical Logic: Theory and Applications, pp 117–119 (2019)

  10. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp 3–42. Princeton University Press, Princeton (1951)

  11. Koppelberg, S.: HandBook of Boolean Algebras, Volume I. North Holland P.C (1989)

  12. Lyndon, R.C., Schützenberger, M.P.: The equation aM = bNcP in a free group. Michigan Math. J. 9(4), 289–298 (1962)

    Article  MathSciNet  Google Scholar 

  13. Minsky, M.L.: Computation: finite and infinite machines. Englewood cliffs, NJ: Prentice-Hall inc. (1967)

  14. Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill Education, New York (1967)

    MATH  Google Scholar 

  15. Schroeppel, R.: A Two-Counter Machine Cannot Calculate 2N. Technical Report, vol. 257. Massachusetts Institute of Technology, A. I. Laboratory (1973)

    Google Scholar 

  16. S̆vejdar, V.: On interpretability in the theory of concatenation. Notre dame J. Formal Logic 50(1), 87–95 (2009)

    MathSciNet  Google Scholar 

  17. Visser, A.: Growing commas. A study of sequentiality and concatenation. Notre dame J. Formal Logic 50(1), 61–85 (2009)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work is funded by Russian Foundation for Basic Research (RFBR), project number 20-01-00435.

Author information

Authors and Affiliations

  1. CS Department, Tver State University, Zhelyabova str., 33, Tver, 170100, Russia

    Sergey Dudakov & Boris Karlov

Authors
  1. Sergey Dudakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boris Karlov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Boris Karlov.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article belongs to the Topical Collection: Special Issue on Computer Science Symposium in Russia (2019)

Guest Editor: Gregory Kucherov

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dudakov, S., Karlov, B. On Decidability of Theories of Regular Languages. Theory Comput Syst 65, 462–478 (2021). https://doi.org/10.1007/s00224-020-09995-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-020-09995-4

Keywords

Search

Navigation