Circular codes and synchronization. (English) Zbl 0401.68050


68Q45 Formal languages and automata
94B50 Synchronization error-correcting codes
Full Text: DOI


[1] A. Ginzgurg,Algebraic Theory of Automata (Academic Press, New York, 1968).
[2] J.-L. Lassez, On the structure of systematic prefix codes,Int. J. Comput. Math., Section A3, 177?188 (September 1972). · Zbl 0262.68018 · doi:10.1080/00207167208803061
[3] R. McNaughton and S. Papert,Counter Free Automata (MIT Press, Cambridge, Massachusetts, 1971). · Zbl 0232.94024
[4] R. McNaughton and S. Papert, ?The Syntactic Monoid of a Regular Event,? inAlgebraic Theory of Machines, Languages and Semigroups, M. A. Arbib, ed. (Academic Press, New York, 1968), pp. 297?312.
[5] A. Restivo, ?Codes and Aperiodic Languages,? inConference on Automata Theory and Formal Languages, Bonn University, July 9?12, 1973. · Zbl 0277.68039
[6] A. Restivo, On a question of McNaughton and Papert,Inf. Control 25(1), 93?101 (May 1974). · Zbl 0279.68054 · doi:10.1016/S0019-9958(74)90821-3
[7] A. Rosenfeld, A note on cycle grammars,Inf. Control 27(4), 374?377 (April 1975). · Zbl 0297.68066 · doi:10.1016/S0019-9958(75)90191-6
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.