The following pages link to (Q3304155):
Displaying 27 items.
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
- Synchronizing times for \(k\)-sets in automata (Q2170794) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- (Q5005121) (← links)
- Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
- (Q5005150) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
- (Q5089200) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- Attainable Values of Reset Thresholds (Q5111255) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- Lower Bounds for Synchronizing Word Lengths in Partial Automata (Q5384430) (← links)
- On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
- Synchronizing Almost-Group Automata (Q5859664) (← links)
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach (Q5885810) (← links)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
- Synchronizing words under \textsf{LTL} constraints (Q6161453) (← links)
- Fast synchronization of inhomogenous random automata (Q6178462) (← links)
- Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)
