Pages that link to "Item:Q1763695"

The following pages link to Synchronizing generalized monotonic automata (Q1763695):

Displaying 31 items.

• On the complexity of existence of homing sequences for nondeterministic finite state machines (Q300305) (← links)
• Černý conjecture for edge-colored digraphs with few junctions (Q510555) (← 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)
• Shortest synchronizing strings for Huffman codes (Q837184) (← links)
• Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
• The annulation threshold for partially monotonic automata (Q845077) (← links)
• Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
• A series of slowly synchronizing automata with a zero state over a small alphabet (Q948092) (← links)
• Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
• Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
• A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387) (← links)
• Extremal synchronizing circular automata (Q2051843) (← links)
• Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
• Preimage problems for deterministic finite automata (Q2208257) (← links)
• Černý's conjecture and group representation theory (Q2269531) (← links)
• On the Synchronizing Probability Function and the Triple Rendezvous Time (Q2799174) (← links)
• On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata (Q2808158) (← links)
• An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
• THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE (Q2909105) (← links)
• Strong Inapproximability of the Shortest Reset Word (Q2946340) (← links)
• Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
• Primitive groups, graph endomorphisms and synchronization (Q2960608) (← links)
• Approximating Minimum Reset Sequences (Q3073634) (← links)
• The Synchronization Problem for Locally Strongly Transitive Automata (Q3182926) (← links)
• (Q3304155) (← links)
• Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
• Shortest Synchronizing Strings for Huffman Codes (Q3599120) (← links)
• Matrix Mortality and the Černý-Pin Conjecture (Q3637214) (← links)
• Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
• Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)