Reset sequences for monotonic automata
SIAM Journal on Computing
Synchronizing monotonic automata
Theoretical Computer Science - Developments in language theory
Synchronizing generalized monotonic automata
Theoretical Computer Science - Insightful theory
A series of slowly synchronizing automata with a zero state over a small alphabet
Information and Computation
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
Synchronizing automata preserving a chain of partial orders
Theoretical Computer Science
Synchronizing automata preserving a chain of partial orders
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
| Hi-index | 0.00 |
A deterministic incomplete automaton ${\mathcal A}=\langle Q,\Sigma,\delta\rangle$ is partially monotonic if its state set Q admits a linear order such that each partial transformation $\delta(\rule{6pt}{.4pt}\,,a)$ with a∈Σ preserves the restriction of the order to the domain of the transformation. We show that if ${\mathcal A}$ possesses a ‘killer' word w∈Σ* whose action is nowhere defined, then ${\mathcal A}$ is ‘killed' by a word of length $|Q|+\left\lfloor\dfrac{|Q|-1}2\right\rfloor$.