Pages that link to "Item:Q3540093"

The following pages link to Synchronizing Automata and the Černý Conjecture (Q3540093):

Displaying 16 items.

• Recognizing 3-collapsing words over a binary alphabet (Q288795) (← links)
• Ideal regular languages and strongly connected synchronizing automata (Q329728) (← links)
• Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← links)
• Synchronizing random automata on a 4-letter alphabet (Q376130) (← links)
• On incomplete and synchronizing finite sets (Q517035) (← links)
• Synchronizing automata with finitely many minimal synchronizing words (Q553327) (← links)
• Algorithm for determining pure pointedness of self-affine tilings (Q626098) (← links)
• The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
• The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
• Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
• Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
• Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
• Slow continued fractions, transducers, and the Serret theorem (Q1686165) (← links)
• On the computational complexity of problems related to distinguishability sets (Q1706155) (← links)
• The complexity of synchronizing Markov decision processes (Q1740670) (← links)