Abstract
Let \(\mathcal{A}=(Q,\Sigma,\delta)\) be a finite deterministic complete automaton. \(\mathcal{A}\) is called k-compressible if there is a word w ∈ Σ + such that the image of the state set Q under the action of w has at most size |Q| − k, in such case the word w is called k-compressing for \(\mathcal{A}\). A word w ∈ Σ + is k-collapsing if it is k-compressing for each k-compressible automaton of the alphabet Σ and it is k-synchronizing if it is k-compressing for each k-compressible automaton with k + 1 states (see [1,2] for details).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ananichev, D.S., Petrov, I.V., Volkov, M.V.: Collapsing words: A progress report. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 11–21. Springer, Heidelberg (2005)
Cherubini, A.: Synchronizing and collapsing words. Milan J. Math. 75, 305–321 (2007)
Margolis, S.W., Pin, J.-E., Volkov, M.V.: Words guaranteeing minimum image. Internat. J. Foundations Comp. Sci. 15, 259–276 (2004)
Sauer, N., Stone, M.G.: Composing functions to reduce image size. Ars. Combinatoria 1, 171–176 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cherubini, A., Frigeri, A., Piochi, B. (2011). Short 3-Collapsing Words over a 2-Letter Alphabet. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)