Abstract
We introduce the generalized notion of automata synchronization, so called partial synchronization, which holds for automata with partial transition function. We give a lower bound for the length of minimal synchronizing words for partial synchronizing automata. The difference, in comparison to the ’classical’ synchronization, lies in the initial conditions: let \(\mathcal{A}=(Q, A, \delta)\) be an automaton representing the dynamics of a particular system. In case of partial synchronization we assume that initial conditions (initial state of the system) can be represented by some particular states, that is by some P ⊂ Q, not necessarily by all possible states from Q. At first glance the above assumption limits our room for manoeuvre for constructing possibly long minimal synchronizing words (because of the lower number of states at the beginning). Unexpectedly this assumption allows us to construct longer minimal synchronizing words than in a standard case. In our proof we use Sperner’s Theorem and some basic combinatorics.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ananichev, D., Volkov, M.: Synchronizing monotonic automata. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 111–121. Springer, Heidelberg (2003)
Benenson, Y., Adar, R., Paz-Elizur, T., Livneh, L., Shapiro, E.: DNA molecule provides a computing machine with both data and fuel. Proc. National Acad. Sci. USA 100, 2191–2196 (2003)
Benenson, Y., Paz-Elizur, T., Adar, R., Keinan, E., Livneh, Z., Shapiro, E.: Programmable and autonomous computing machine of biomolecules. Nature 414, 430–434 1 (2001)
Černý, J.: Poznámka k. homogénnym experimentom s konecnymi automatmi. Mat. fyz. cas SAV 14, 208–215 (1964)
Černý, J., Pirická, A., Rosenauerova, B.: On directable automata. Kybernetica 7, 289–298 (1971)
Ito, M., Shikishima-Tsuji, K.: Some results on directable automata. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 125–133. Springer, Heidelberg (2004)
Kari, J.: Synchronization and Stability of Finite Automata. JUCS 8, 2, 270–277 (2002)
Martyugin, P.V.: Lower bounds for length of carefully synchronizing words. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, Springer, Heidelberg (2006)
Natarajan, B.K.: An algorithmic Approach to the Automated Design of Parts Orienters. In: Proc. 27th Annual Symp. Foundations of Computer Science, pp. 132–142. IEEE, Los Alamitos (1986)
Natarajan, B.K.: Some paradigms for the automated design of parts feeders. Int. J. Robotic Research 8, 6, 89–109 (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roman, A., Foryś, W. (2008). Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77566-9_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-77566-9_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77565-2
Online ISBN: 978-3-540-77566-9
eBook Packages: Computer ScienceComputer Science (R0)