Pages that link to "Item:Q3032279"
From MaRDI portal
The following pages link to In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton (Q3032279):
Displaying 16 items.
- Reset words for commutative and solvable automata (Q1392028) (← links)
- Almost optimal bound of recurrent word length for regular automata (Q1922340) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata (Q2808158) (← links)
- Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (Q2947421) (← links)
- A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM (Q3021964) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- Approximating Minimum Reset Sequences (Q3073634) (← links)
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
- (Q3304155) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- Genetic Algorithm for Synchronization (Q3618622) (← links)
- Matrix Mortality and the Černý-Pin Conjecture (Q3637214) (← links)
- On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
