A series of slowly synchronizing automata with a zero state over a small alphabet
From MaRDI portal
Publication:948092
DOI10.1016/j.ic.2008.03.020zbMath1151.68029OpenAlexW2030262845MaRDI QIDQ948092
Publication date: 8 October 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10995/72220
Related Items (5)
Unnamed Item ⋮ Slowly synchronizing automata with zero and noncomplete sets ⋮ COMPAS - A Computing Package for Synchronization ⋮ On finite monoids over nonnegative integer matrices and short killing words ⋮ On Nonnegative Integer Matrices and Short Killing Words
Cites Work
- Synchronizing monotonic automata
- Reset words for commutative and solvable automata
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing generalized monotonic automata
- Reset Sequences for Monotonic Automata
- SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
- Developments in Language Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A series of slowly synchronizing automata with a zero state over a small alphabet
