|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, Number 1, Pages 59–68
(Mi ivm6552)
|
|
|
|
This article is cited in 21 scientific papers (total in 21 papers)
A lower bound for the length of the shortest carefully synchronizing words
P. V. Martyugin Ural State University, Ekaterinburg, Russia
Abstract:
We introduce a notion of careful synchronization for partial finite automata as a natural generalization of the synchronization notion for complete finite automata. We obtain a lower bound for the careful synchronization threshold for automata with a given number of states.
Keywords:
finite automaton, partial finite automaton, synchronizability.
Received: 06.12.2006
Citation:
P. V. Martyugin, “A lower bound for the length of the shortest carefully synchronizing words”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 1, 59–68; Russian Math. (Iz. VUZ), 54:1 (2010), 46–54
Linking options:
https://www.mathnet.ru/eng/ivm6552 https://www.mathnet.ru/eng/ivm/y2010/i1/p59
|
Statistics & downloads: |
Abstract page: | 304 | Full-text PDF : | 53 | References: | 50 | First page: | 3 |
|