𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automata and differentiable words

✍ Scribed by Jean-Marc Fédou; Gabriele Fici

Book ID
113927749
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
410 KB
Volume
443
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Relating word and tree automata
Relating word and tree automata
✍ Orna Kupferman; Shmuel Safra; Moshe Y. Vardi 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 301 KB
Reset words for commutative and solvable
Reset words for commutative and solvable automata
✍ Igor Rystsov 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 451 KB

A reset word takes all states of a finite automaton to a single state. In this paper, it is shown that the length of the shortest reset word for a solvable automaton with n states is at most n -1 and this bound is reachable.