Pages that link to "Item:Q3893317"
From MaRDI portal
The following pages link to Asymptotic estimate of the length of a diagnostic word for a finite automaton (Q3893317):
Displayed 10 items.
- Theory of general linear automata (Q1040342) (← links)
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- Preset Distinguishing Sequences and Diameter of Transformation Semigroups (Q2799186) (← links)
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA (Q5125223) (← links)
- Lower Bounds for Synchronizing Word Lengths in Partial Automata (Q5384430) (← links)
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach (Q5885810) (← links)
- On the smallest synchronizing terms of finite tree automata (Q6199864) (← links)