Abstract
We extend the classical characterization (a.k.a. Medvedev theorem) of any regular language as the homomorphic image of a local language over an alphabet of cardinality depending on the size of the language recognizer. We allow strictly locally testable (slt) languages of degree greater than two, and instead of a homomorphism, we use a rational function of the local type. By encoding the automaton computations using comma-free codes, we prove that any regular language is the image computed by a length-preserving local function, which is defined on an alphabet that extends the terminal alphabet by just one additional letter. A binary alphabet suffices if the local function is not required to preserve the input length, or if the regular language has polynomial density. If, instead of a local function, a local relation is allowed, a binary input alphabet suffices for any regular language. From this, a new simpler proof is obtained of the already known extension of Medvedev theorem stating that any regular language is the homomorphic image of an slt language over an alphabet of double size.
Work partially supported by CNR - IEIIT.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Unfortunately, the adjective “local”, for slt languages means of testability degree two, whereas for the locality degree of functions, it means any integer value.
References
Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)
Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, Cambridge (2015)
Crespi Reghizzi, S., San Pietro, P.: From regular to strictly locally testable languages. Int. J. Found. Comput. Sci. 23(8), 1711–1728 (2012)
De Luca, A., Restivo, A.: A characterization of strictly locally testable languages and its applications to subsemigroups of a free semigroup. Inf. Control 44(3), 300–319 (1980)
McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)
Medvedev, Y.T.: On the class of events representable in a finite automaton. In: Moore, E.F. (ed.) Sequential Machines – Selected Papers, pp. 215–227. Addison-Wesley, Reading (1964)
Perrin, D., Reutenauer, C.: Hall sets, Lazard sets and comma-free codes. Discrete Math. 341(1), 232–243 (2018)
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, New York (1974)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)
Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 494–503. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55808-X_48
Acknowledgements
D. Perrin directed us to comma-free codes. We thank the anonymous referees for their helpful suggestions.
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
Crespi Reghizzi, S., San Pietro, P. (2019). Regular Languages as Local Functions with Small Alphabets. In: Ćirić, M., Droste, M., Pin, JÉ. (eds) Algebraic Informatics. CAI 2019. Lecture Notes in Computer Science(), vol 11545. Springer, Cham. https://doi.org/10.1007/978-3-030-21363-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-21363-3_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-21362-6
Online ISBN: 978-3-030-21363-3
eBook Packages: Computer ScienceComputer Science (R0)