Abstract
Various characterizations of codes are given with a finite synchronization delay. Decidability and bounds on the delay are established in particular cases.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. Ginzgurg,Algebraic Theory of Automata (Academic Press, New York, 1968).
J.-L. Lassez, On the structure of systematic prefix codes,Int. J. Comput. Math., Section A3, 177–188 (September 1972).
R. McNaughton and S. Papert,Counter Free Automata (MIT Press, Cambridge, Massachusetts, 1971).
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.
A. Restivo, “Codes and Aperiodic Languages,” inConference on Automata Theory and Formal Languages, Bonn University, July 9–12, 1973.
A. Restivo, On a question of McNaughton and Papert,Inf. Control 25(1), 93–101 (May 1974).
A. Rosenfeld, A note on cycle grammars,Inf. Control 27(4), 374–377 (April 1975).
Author information
Authors and Affiliations
Additional information
Work done at Summer Research Institute of the Canadian Mathematical Congress, supported by the National Research Council of Canada.
Rights and permissions
About this article
Cite this article
Lassez, J.L. Circular codes and synchronization. International Journal of Computer and Information Sciences 5, 201–208 (1976). https://doi.org/10.1007/BF00975632
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00975632