✦ LIBER ✦

Graph exploration by a finite automaton

✍ Scribed by Pierre Fraigniaud; David Ilcinkas; Guy Peer; Andrzej Pelc; David Peleg

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rank of a finite automaton

✍ I. K. Rystsov 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 545 KB

Finite-automaton semigroup mappings

✍ A. V. Anisimov 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 978 KB

The interchange graph of a finite graph

✍ A. C. M. van Rooij; H. S. Wilf 📂 Article 📅 1965 🏛 Akadmiai Kiad 🌐 English ⚖ 284 KB

Evaluating the complexity of a finite au

✍ A. V. Palagin 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 395 KB

Synthesizing a finite automaton from its

✍ M. A. Spivak 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 445 KB

Some properties of the basis finite auto

✍ Melnikov, B. F. ;Melnikova, A. A. 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 164 KB