Pages that link to "Item:Q3088281"

The following pages link to Modifying the Upper Bound on the Length of Minimal Synchronizing Word (Q3088281):

Displaying 19 items.

• Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← links)
• Complexity of a problem concerning reset words for Eulerian binary automata (Q515691) (← links)
• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
• Models and algorithms of automata theory for the control of an aircraft group (Q1716763) (← links)
• Černý's conjecture and the road colouring problem (Q2074216) (← links)
• A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
• Shortest positive products of nonnegative matrices (Q2637146) (← 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)
• Experiments with Synchronizing Automata (Q2830218) (← links)
• Synchronizing Automata on Quasi-Eulerian Digraph (Q2914697) (← links)
• P(l)aying for Synchronization (Q2914704) (← links)
• Synchronizing Automata of Bounded Rank (Q2914705) (← links)
• Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)
• Synchronizing Automata with Extremal Properties (Q2946348) (← links)
• (Q3304155) (← links)
• Coupling any number of balls in the infinite-bin model (Q4684871) (← links)
• (Q5740433) (← links)
• Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)