Pages that link to "Item:Q2795936"
From MaRDI portal
The following pages link to On the Probability of Being Synchronizable (Q2795936):
Displayed 15 items.
- Groups synchronizing a transformation of non-uniform kernel (Q391192) (← links)
- Diameter and stationary distribution of random \(r\)-out digraphs (Q785578) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Automata and finite order elements in the Nottingham group (Q2132478) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- Circular automata synchronize with high probability (Q2221830) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- Reduced checking sequences using unreliable reset (Q2339596) (← links)
- On the Number of Synchronizing Colorings of Digraphs (Q2947415) (← links)
- Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
- (Q5005150) (← links)
- Synchronizing Almost-Group Automata (Q5859664) (← links)
- The road problem and homomorphisms of directed graphs (Q6175007) (← links)