= 3; if z ? {1, 2} and {1, za} ? {x, y} = ?, then |M(bab)| = 3; if {1, 1b} ? {x, y} = ?, then |M(ab 2 )| = 3; if 1 ? {x, y} and {z, 1b} ? {1, 2} = ?, then |M(aba)| = 3. So each automaton that does not satisfy one of the conditions of the lemma is 3-compressed by a word of length 3, and then it is not proper ,
Quest for short synchronizing words and short collapsing words, WORDS. Proc. 4th Int. Conf, pp.411-418, 2003. ,
COLLAPSING WORDS: A PROGRESS REPORT, Developments in Language Theory, pp.11-21, 2005. ,
DOI : 10.1007/BF01459084
Constraint LTL satisfiability checking without automata, Constraint LTL satisfiability checking without automata, pp.522-557, 2014. ,
DOI : 10.1016/j.jal.2014.07.005
URL : http://arxiv.org/abs/1205.0946
Synchronizing and Collapsing Words, Milan Journal of Mathematics, vol.75, issue.1, pp.305-321, 2007. ,
DOI : 10.1007/s00032-007-0070-z
Binary 3-compressible automata, Proceedings of the 15th Italian Conference on Theoretical Computer Science (ICTCS 2014), volume 1231 of CEUR Workshop Proceedings, pp.109-120, 2014. ,
Recognizing 3-collapsing words over a binary alphabet, Theoretical Computer Science, vol.629, issue.C, pp.64-79, 2016. ,
DOI : 10.1016/j.tcs.2015.10.045
A bound for the length of shortest 2 collapsing words, DMTCS, vol.11, issue.1, pp.33-44, 2009. ,
Short 3-Collapsing Words over a 2-Letter Alphabet, Developments in Language Theory. DLT 2011, pp.469-471, 2011. ,
DOI : 10.1007/978-3-642-22321-1_42
Improved inapproximability results for the shortest superstring and related problems, 19th Computing: The Australasian Theory Symposium (CATS 2013), pp.27-36, 2013. ,
Effective synchronizing algorithms, Expert Systems with Applications, vol.39, issue.14, pp.11746-11757, 2012. ,
DOI : 10.1016/j.eswa.2012.04.079
WORDS GUARANTEEING MINIMUM IMAGE, International Journal of Foundations of Computer Science, vol.31, issue.02, pp.259-276, 2004. ,
DOI : 10.1007/BF01236507
An algorithm for recognition of n-collapsing words, Theoretical Computer Science, vol.391, issue.1-2, pp.99-108, 2008. ,
DOI : 10.1016/j.tcs.2007.10.034
Identities in full transformation semigroups, Algebra Universalis, vol.45, issue.No. 3, pp.580-588, 1994. ,
DOI : 10.1007/BF01236507
On some properties of the language of 2-collapsing words, Developments in Language Theory, pp.374-384, 2005. ,
The shortest common supersequence problem over binary alphabet is NP-complete, Theoretical Computer Science, vol.16, issue.2, pp.187-198, 1981. ,
DOI : 10.1016/0304-3975(81)90075-X
Composing functions to reduce image size, Ars Combinatoria, vol.1, pp.171-176, 1991. ,
An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the ?erny Conjecture, Procedings of MFCS, pp.789-800, 2006. ,
DOI : 10.1007/11821069_68
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.2103
Approximation algorithms for the shortest common superstring problem, Information and Computation, vol.83, issue.1, pp.1-20, 1989. ,
DOI : 10.1016/0890-5401(89)90044-8
URL : http://doi.org/10.1016/0890-5401(89)90044-8
Synchronizing Automata and the ?ern? Conjecture, Language and Automata Theory and Applications, pp.11-27, 2008. ,
DOI : 10.1007/978-3-540-88282-4_4