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.020zbMATH Open1151.68029OpenAlexW2030262845MaRDI QIDQ948092FDOQ948092
Authors: P. V. Martugin 
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
Recommendations
Cites Work
- Synchronizing generalized monotonic automata
- Title not available (Why is that?)
- Synchronizing finite automata on Eulerian digraphs.
- Reset Sequences for Monotonic Automata
- The Černý conjecture for aperiodic automata
- Title not available (Why is that?)
- SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
- Synchronizing monotonic automata
- Reset words for commutative and solvable automata
- Developments in Language Theory
Cited In (9)
- Synchronizing automata with a letter of deficiency 2
- On Nonnegative Integer Matrices and Short Killing Words
- Title not available (Why is that?)
- On finite monoids over nonnegative integer matrices and short killing words
- Synchronizing Automata with a Letter of Deficiency 2
- Slowly synchronizing automata with fixed alphabet size
- Slowly synchronizing automata with zero and noncomplete sets
- Title not available (Why is that?)
- COMPAS -- a computing package for synchronization
This page was built for publication: A series of slowly synchronizing automata with a zero state over a small alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948092)
