The Synchronization Problem for Strongly Transitive Automata

DOI10.1007/978-3-540-85780-8_19MaRDI QIDQ3533015zbMATHOpenAlexFDO

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

zbMATH Keywords

rational seriessynchronizing automataČerný conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3529706 (Why is no real title available?)
• scientific article; zbMATH DE number 3605922 (Why is no real title available?)
• scientific article; zbMATH DE number 1346363 (Why is no real title available?)
• scientific article; zbMATH DE number 3803447 (Why is no real title available?)
• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• Almost optimal bound of recurrent word length for regular automata
• An extremal problem for two families of sets
• On synchronizing unambiguous automata
• Synchronizing finite automata on Eulerian digraphs.
• The Černý conjecture for aperiodic automata
• Unambiguous automata

Cited in

(14)

• scientific article; zbMATH DE number 6665216 (Why is no real title available?)
• On a conjecture by Carpi and D'Alessandro
• scientific article; zbMATH DE number 3921986 (Why is no real title available?)
• The Černý conjecture for one-cluster automata with prime length cycle
• A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
• Trim Strongly Connected Synchronizing Automata and Ideal Languages
• Semisimple synchronizing automata and the Wedderburn-Artin theory
• Strongly transitive automata and the Černý conjecture
• On incomplete and synchronizing finite sets
• On synchronizing unambiguous automata
• A tight linear bound on the synchronization delay of bijective automata
• An algorithm for road coloring
• A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM
• The Synchronization Problem for Locally Strongly Transitive 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)