This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
BOOK R.V. (1973), Free and almost-free subsemigroups of a free semigroup, Discrete Mathematics, 4, 233–241.
BRZOZOWSKI J.A. and SIMON I. (1971), Characterization of locally testable events, Proceedings of 12th Annual Symposium on Switching and Automata Theory, October–IEEE, N.Y.
LENTIN A. and SCHÜTZENBERGER M.P. (1967) A combinatorial problem in the theory of free monoid, Combinatorial Mathematics and its Appication, Bose and Bowling Eds., University of North Carolina Press, 128–144.
McNAUGHTON R. (1971), Algebraic decision procedures for local testability (preprint).
McNAUGHTON R. and PAPERT S. (1971), Counter-Free Automata, MIT Press.
NIVAT M. (1966) Elements de la theorie generale des codes, in Automata Theory, Caianiello Editor, Academic Press, 278–294.
RESTIVO A. (1973), On a question of McNaughton and Papert (sent for publication).
SCHÜTZENBERGER M.P. (1956a), On an application of semigroup methods to some problems in coding, IRE Trans. on Information Theory, IT-2, 47.
SCHÜTZENBERGER M.P. (1956b), Une theorie algebrique du codage C.R. Acad. Sci. Paris, 242, 862–864.
ZALCSTEIN Y. (1972), Locally Testable Languages. Journal of Computer and System Science, 6, 151–167.
Rights and permissions
Copyright information
© 1973 Springer-Verlag
About this paper
Cite this paper
Restivo, A. (1973). Codes and aperiodic languages. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039152
Download citation
DOI: https://doi.org/10.1007/BFb0039152
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06527-2
Online ISBN: 978-3-540-37826-6
eBook Packages: Springer Book Archive