Abstract
This paper is dedicated to studying decidability properties of some regular languages theories. We prove that the regular languages theory with the Kleene star only is decidable. If we use union and concatenation simultaneously then the theory becomes both \(\varSigma _1\)- and \(\varPi _1\)-hard over the one-symbol alphabet. Finally, we prove that the regular languages theory over one-symbol alphabet with union and the Kleene star is equivalent to arithmetic. The Kleene star is definable with union and concatenation, hence, the previous theory is equivalent to arithmetic also.
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 subscriptionsReferences
Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation and Compiling. Volume 1: Parsing. Prentice-Hall Inc., Englewood Cliffs (1972)
Boolos, G.S., Burgess, J.P., Jeffrey, R.C.: Computability and Logic, 5th edn. Cambridge University Press, New York (2007)
Grzegorczyk, A.: Undecidability without arithmetization. Stud. Logica 79(2), 163–230 (2005)
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)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Pearson, Harlow (2013)
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)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Inc., Englewood Cliffs (1967)
Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill Education, New York (1967)
Schroeppel, R.: A Two-Counter Machine Cannot Calculate \(2^N\). Technical Report 257, Massachusetts Institute of Technology, A. I. Laboratory (1973)
S̆vejdar, V.: On interpretability in the theory of concatenation. Notre Dame J. Formal Logic 50(1), 87–95 (2009)
Visser, A.: Growing commas. A study of sequentiality and concatenation. Notre Dame J. Formal Logic 50(1), 61–85 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Dudakov, S., Karlov, B. (2019). 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. Springer, Cham. https://doi.org/10.1007/978-3-030-19955-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-19955-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19954-8
Online ISBN: 978-3-030-19955-5
eBook Packages: Computer ScienceComputer Science (R0)