✦ LIBER ✦

Synchronizing automata with finitely many minimal synchronizing words

✍ Scribed by Elena V. Pribavkina; Emanuele Rodaro

Book ID: 113641953
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 533 KB
Volume: 209
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.11.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the shortest reset words of sy

Computing the shortest reset words of synchronizing automata

✍ Kisielewicz, Andrzej; Kowalski, Jakub; Szykuła, Marek 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 591 KB

Optimal Synchronizing Experiments with L

Optimal Synchronizing Experiments with Linear Automata

✍ A.S. Bogomolov; D.V. Speranskii 📂 Article 📅 2001 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 97 KB

Slowly synchronizing automata with zero

Slowly synchronizing automata with zero and noncomplete sets

✍ E. V. Pribavkina 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 660 KB

Computational Complexity of Certain Prob

Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata

✍ Martyugin, Pavel 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 489 KB

Primitive digraphs with large exponents

Primitive digraphs with large exponents and slowly synchronizing automata

✍ D. S. Ananichev, M. V. Volkov, V. V. Gusev 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 479 KB

Synchronizing finite automata on Euleria

Synchronizing finite automata on Eulerian digraphs

✍ Jarkko Kari 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 126 KB

Ä CernÃ y's conjecture and the road coloring problem are two open problems concerning synchronization of ÿnite automata. We prove these conjectures in the special case that the vertices have uniform in-and outdegrees.