Finitely Generated Synchronizing Automata

DOI10.1007/978-3-642-00982-2_57MaRDI QIDQ3618621zbMATH OpenOpenAlexFDO

Authors Elena Pribavkina, Emanuele Rodaro

Publication date 2 April 2009

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00982-2_57

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Synchronizing automata with finitely many minimal synchronizing words
• Synchronization of Some DFA
• Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete
• 2-Synchronizing Words
• Modifying the upper bound on the length of minimal synchronizing word

Cites work

• scientific article; zbMATH DE number 1346363 (Why is no real title available?)
• Resetting words for decidable automata
• Synchronizing Automata and the Černý Conjecture
• The Theory of Definite Automata
• WORDS GUARANTEEING MINIMUM IMAGE

Cited in

(11)

• Synchronizing finite automata with short reset words
• Synchronizing generalized monotonic automata
• Groups and semigroups defined by colorings of synchronizing automata.
• Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete
• Ideal regular languages and strongly connected synchronizing automata
• 2-Synchronizing Words
• Genetic Algorithm for Synchronization
• scientific article; zbMATH DE number 1834666 (Why is no real title available?)
• Synchronizing automata with finitely many minimal synchronizing words
• Synchronization of finite automata
• The mirror image of the language of 2-synchronizing words

This page was built for publication: Finitely Generated Synchronizing Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618621)