Pages that link to "Item:Q5208377"
From MaRDI portal
The following pages link to An improvement to a recent upper bound for synchronizing words of finite automata (Q5208377):
Displaying 21 items.
- Extremal binary PFAs in a Černý family (Q832924) (← links)
- Synchronizing words for real-time deterministic pushdown automata (extended abstract) (Q2079977) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← links)
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents (Q2164757) (← links)
- Synchronizing times for \(k\)-sets in automata (Q2170794) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- Circular automata synchronize with high probability (Q2221830) (← links)
- A tight linear bound on the synchronization delay of bijective automata (Q2373732) (← 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)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach (Q5885810) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
- Synchronizing words under \textsf{LTL} constraints (Q6161453) (← links)
- Extremal Binary PFAs with Small Number of States (Q6169960) (← links)
- Fast synchronization of inhomogenous random automata (Q6178462) (← links)
- Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)