The following pages link to Synchronizing monotonic automata (Q703567):
Displaying 16 items.
- Groups synchronizing a transformation of non-uniform kernel (Q391192) (← links)
- Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134) (← links)
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- The annulation threshold for partially monotonic automata (Q845077) (← links)
- A series of slowly synchronizing automata with a zero state over a small alphabet (Q948092) (← links)
- Synchronizing finite automata with short reset words (Q1008633) (← links)
- Synchronizing generalized monotonic automata (Q1763695) (← links)
- Extremal synchronizing circular automata (Q2051843) (← links)
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents (Q2164757) (← links)
- Synchronizing sequences for road colored digraphs (Q2197412) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- 2-Synchronizing Words (Q3540111) (← links)
- Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (Q5200068) (← links)
- Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata (Q5250279) (← links)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
