Complexity of problems concerning reset words for cyclic and Eulerian automata
From MaRDI portal
Publication:442134
DOI10.1016/j.tcs.2012.04.022zbMath1279.68163MaRDI QIDQ442134
Publication date: 9 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.022
Related Items
Unnamed Item, Synchronizing series-parallel deterministic finite automata with loops and related problems, Complexity of a problem concerning reset words for Eulerian binary automata, The relation between preset distinguishing sequences and synchronizing sequences, Approximating the minimum length of synchronizing words is hard
Cites Work
- Synchronizing monotonic automata
- Synchronizing automata preserving a chain of partial orders
- Synchronizing finite automata on Eulerian digraphs.
- Approximating the minimum length of synchronizing words is hard
- Composition sequences for functions over a finite domain.
- Reset Sequences for Monotonic Automata
- The Complexity of Finding Reset Words in Finite Automata
- On two Combinatorial Problems Arising from Automata Theory
- Unnamed Item
- Unnamed Item