Pages that link to "Item:Q5200075"
From MaRDI portal
The following pages link to Experimental Study of the Shortest Reset Word of Random Automata (Q5200075):
Displayed 10 items.
- Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← links)
- Synchronizing random automata on a 4-letter alphabet (Q376130) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata (Q2808158) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA (Q5125223) (← links)
- Fast synchronization of inhomogenous random automata (Q6178462) (← links)