✦ LIBER ✦

Shortest directing words of nondeterministic directable automata

✍ Scribed by Masami Ito; Kayoko Shikishima-Tsuji

Book ID: 108113914
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 157 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.09.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On the directional dynamics of additive

On the directional dynamics of additive cellular automata

✍ A. Dennunzio; P. Di Lena; E. Formenti; L. Margara 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 771 KB

On congruences of automata defined by di

On congruences of automata defined by directed graphs

✍ A.V. Kelarev; O.V. Sokratova 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Computing with Snakes in Directed Networ

Computing with Snakes in Directed Networks of Automata

✍ Shimon Even; Ami Litman; Peter Winkler 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 146 KB

We consider unidirectional, strongly connected networks of identical finite-state automata, of bounded in-and out-degree but unknown topology and unbounded size n. Protocols which are quadratic or linear in n are provided which accomplish the following tasks: wake up and report when done; construct

Simulation of bi-direction pedestrian mo

Simulation of bi-direction pedestrian movement using a cellular automata model

✍ Fang Weifeng; Yang Lizhong; Fan Weicheng 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 252 KB