Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata

DOI10.1007/978-3-540-77566-9_39zbMath1132.68461OpenAlexW1596878351MaRDI QIDQ5448671

Adam Roman, Wit Foryś

Publication date: 7 March 2008

Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_39

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Theory Is Forever
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata