Abstract
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\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ananichev, D.S., Volkov, M.V.: Synchronizing monotonic automata. Theoret. Comput. Sci. 327, 225–239 (2004)
Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theoret. Comput. Sci. 330, 3–13 (2005)
Černý, J.: Poznámka k homogénnym eksperimentom s konecnými automatami, Mat.- Fyz. Cas. Slovensk. Akad. Vied 14, 208–216 (1964) (in Slovak)
Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19, 500–510 (1990)
Rystsov, I.: Reset words for commutative and solvable automata. Theoret. Comput. Sci. 172, 273–279 (1997)
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8, 190–194 (1965)
Trahtman, N.: Černý conjecture for DFA accepting star-free languages (submitted)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ananichev, D.S. (2005). The Mortality Threshold for Partially Monotonic Automata. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_10
Download citation
DOI: https://doi.org/10.1007/11505877_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26546-7
Online ISBN: 978-3-540-31682-4
eBook Packages: Computer ScienceComputer Science (R0)