Pages that link to "Item:Q2946348"
From MaRDI portal
The following pages link to Synchronizing Automata with Extremal Properties (Q2946348):
Displaying 26 items.
- Primitive digraphs with large exponents and slowly synchronizing automata (Q376118) (← links)
- Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
- A series of slowly synchronizing automata with a zero state over a small alphabet (Q948092) (← links)
- On synchronizing unambiguous automata (Q1116340) (← links)
- Deterministic synchronization of automata with bounded delay (Q1127313) (← links)
- Dynamics of the independence number and automata synchronization (Q1622986) (← links)
- Synchronizing generalized monotonic automata (Q1763695) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Extremal synchronizing circular automata (Q2051843) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Synchronizing times for \(k\)-sets in automata (Q2170794) (← links)
- A tight linear bound on the synchronization delay of bijective automata (Q2373732) (← links)
- An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
- Experiments with Synchronizing Automata (Q2830218) (← links)
- On the Number of Synchronizing Colorings of Digraphs (Q2947415) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- Experiments on Synchronizing Automata (Q3113296) (← links)
- Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
- (Q4779162) (← links)
- (Q5005150) (← links)
- Attainable Values of Reset Thresholds (Q5111255) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- Reset Complexity of Ideal Languages Over a Binary Alphabet (Q5205048) (← links)
- Hardly reachable subsets and completely reachable automata with 1-deficient words (Q5208375) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
- Semisimple synchronizing automata and the Wedderburn-Artin theory (Q5890812) (← links)
