The Synchronization Problem for Strongly Transitive Automata
From MaRDI portal
Publication:3533015
DOI10.1007/978-3-540-85780-8_19zbMATH Open1161.68517OpenAlexW2146506707MaRDI QIDQ3533015FDOQ3533015
Authors: Flavio D'Alessandro, Arturo Carpi 
Publication date: 30 October 2008
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_19
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extremal problem for two families of sets
- Synchronizing finite automata on Eulerian digraphs.
- Title not available (Why is that?)
- The Černý conjecture for aperiodic automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- On synchronizing unambiguous automata
- Title not available (Why is that?)
- Unambiguous automata
- Almost optimal bound of recurrent word length for regular automata
- Title not available (Why is that?)
Cited In (14)
- On synchronizing unambiguous automata
- Strongly transitive automata and the Černý conjecture
- Semisimple synchronizing automata and the Wedderburn-Artin theory
- Title not available (Why is that?)
- On a conjecture by Carpi and D'Alessandro
- The Synchronization Problem for Locally Strongly Transitive Automata
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
- Trim Strongly Connected Synchronizing Automata and Ideal Languages
- An algorithm for road coloring
- Title not available (Why is that?)
- A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM
- The Černý conjecture for one-cluster automata with prime length cycle
- On incomplete and synchronizing finite sets
- A tight linear bound on the synchronization delay of bijective automata
This page was built for publication: The Synchronization Problem for Strongly Transitive Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533015)
