Abstract
In spite of its simple formulation, the problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the general framework of a composition theory for functions over a finite domain N with n elements. The notion of depth introduced in this connection is a good indication of the complexity of a given function, namely, the complexity with respect to the length of composition sequences in terms of functions belonging to a basic set. Our results show that the depth may vary considerably with the target function. We also establish criteria about the reachability of some target functions, notably constants. Properties of n such as primality or being a power of 2 turn out to be important, independently of the semantic interpretation. Most of the questions about depth, as well as about the comparison of different notions of depth, remain open. Our results show that the study of functions of several variables may shed light also to the case where all functions considered are unary.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Adler, I. Goodwin and B. Weiss, Equivalence of topological Markov shifts. Israel J. Math. 27 (1977) 49–63.
S. Bogdanović, B. Imreh, M. Ćirić and T. Petković, Directable automata and their generalizations: a survey. Novi Sad J. Math. 29 (1999).
J. Černý, Poznámka k homogénnym experimentom s konečnými automatmi. Mat.fyz.čas SAV 14 (1964) 208-215.
J. Černý, A. Pirická and B. Rosenauerová, On directable automata. Kybernetika 7 (1971) 289–298.
L. Dubuc, Sur les automates circulaires et la conjecture de Černý. Informatique Théorique et Applications 32 (1998) 21–34.
D. Epsein, Reset sequences for monotonic automata. Siam J. Comput. 19 (1990) 500–510.
B. Imreh and M. Steinby, Directable nondeterministic automata. Acta Cybernetica 14 (1999) 105–116.
A. Mateescu and A. Salomaa, Many-valued truth functions, Černý’s conjecture and road coloring. EATCS Bulletin 68 (1999) 134–150.
E.F. Moore, Gedanken experiments on sequential machines. In C.E. Shannon and J. McCarthy (ed.) Automata Studies, Princeton University Press (1956) 129–153.
G. Păun, G. Rozenberg and A. Salomaa, DNA Computing. New Computing Paradigms. Springer-Verlag, Berlin, Heidelberg, New York (1998).
S. Piccard, Sur les bases du groupe symétrique et les couples de substitutions qui engendrent un goupe régulier. Librairie Vuibert, Paris (1946).
J.-E. Pin, Le probléme de la synchronisation, Contribution a l’étude de la conjecture de Černý. Thèse de 3e cycle a l’Université Pierre et Marie Curie (Paris 6) (1978).
E. Post, Introduction to a general theory of elementary propositions. Amer. J. Math. 43 (1921) 163–185.
A. Salomaa, A theorem concerning the composition of functions of several variables ranging over a finite set. J. Symb. Logic 25 (1960) 203–208.
A. Salomaa, On the composition of functions of several variables ranging over a finite set. Ann. Univ. Turkuensis, Ser. AI, 41 (1960).
A. Salomaa, On basic groups for the set of functions over a finite domain. Ann. Acad. Scient. Fennicae, Ser. AI, 338 (1963).
A. Salomaa, Composition sequences for functions over a finite domain. Turku Centre for Computer Science Technical Report 332 (2000). To appear in Theoretical Computer Science.
A. Salomaa, Depth of functional compositions. EATCS Bulletin 71 (2000) 143–150.
A. Salomaa, Compositions over a finite domain: from completeness to synchronizable automata. In A. Salomaa, D. Wood and S. Yu (Ed.) A Half-Century of Automata Theory, World Scientific Publ. Co. (2001) 131–143.
S.V. Yablonskii, Functional constructions in k-valued logic (in Russian). Tr.Matem.Inst. im. V.A.Steklova 51,5 (1958) 5–142.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Salomaa, A. (2002). Synchronization of Finite Automata: Contributions to an Old Problem. In: Mogensen, T.Æ., Schmidt, D.A., Sudborough, I.H. (eds) The Essence of Computation. Lecture Notes in Computer Science, vol 2566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36377-7_3
Download citation
DOI: https://doi.org/10.1007/3-540-36377-7_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00326-7
Online ISBN: 978-3-540-36377-4
eBook Packages: Springer Book Archive