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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Shcherbak, T. (2006). The interval rank of monotonic automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3845 LNCS, pp. 273–281). https://doi.org/10.1007/11605157_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
