Synchronizing monotonic automata
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3609145 (Why is no real title available?)
- scientific article; zbMATH DE number 1346363 (Why is no real title available?)
- scientific article; zbMATH DE number 2040899 (Why is no real title available?)
- scientific article; zbMATH DE number 1834666 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- A counter example to a conjecture concerning synchronizing words in finite automata
- Reset Sequences for Monotonic Automata
Cited in
(15)- 2-Synchronizing Words
- Groups synchronizing a transformation of non-uniform kernel
- COMPAS -- a computing package for synchronization
- Synchronizing finite automata with short reset words
- A series of slowly synchronizing automata with a zero state over a small alphabet
- Extremal synchronizing circular automata
- Synchronizing sequences for road colored digraphs
- The relation between preset distinguishing sequences and synchronizing sequences
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
- Synchronizing generalized monotonic automata
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- The annulation threshold for partially monotonic automata
- Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
This page was built for publication: Synchronizing monotonic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703567)