Abstract
We solve the ‘order preserving’ version of the generalized Černý problem (also known as the rank problem). Namely, for all n and k such that 2 ≤ k ≤ n, we determine the least number ℓ(n,k) such that for each monotonic automaton with n states and interval rank k there exists a word of length ℓ(n,k) that compresses the state set of the automaton to an interval of length k.
This is a preview of subscription content, log in via an institution to check access.
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
Černý, J.: Poznámka k homogénnym eksperimentom s konecnými automatami. Mat.-Fyz. Cas. Slovensk. Akad. Vied. 14, 208–216 (1964) [in Slovak]
Rystsov, I.: Rank of a finite automaton. Cybernetics and System Analysis 28, 323–328 (1992)
Mateescu, A., Salomaa, A.: Many-valued truth functions, Černý’s conjecture and road coloring. Bull. EATCS 68, 134–150 (1999)
Ananichev, D.S., Volkov, M.V.: Synchronizing monotonic automata. Theoret. Comput. Sci. 327, 225–239 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shcherbak, T. (2006). The Interval Rank of Monotonic Automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_23
Download citation
DOI: https://doi.org/10.1007/11605157_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31023-5
Online ISBN: 978-3-540-33097-4
eBook Packages: Computer ScienceComputer Science (R0)