✦ LIBER ✦

Synthesis of computer programs that implement finite automata

✍ Scribed by D. I. Cheremisinov

Book ID: 111496295
Publisher: Allerton Press Inc
Year: 2007
Tongue: English
Weight: 169 KB
Volume: 41
Category: Article
ISSN: 0146-4116
DOI: 10.3103/s0146411607040050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Impl

[Lecture Notes in Computer Science] Implementation and Application of Automata Volume 4094 || Structurally Unambiguous Finite Automata

✍ Ibarra, Oscar H.; Yen, Hsu-Chun 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg ⚖ 405 KB

[Lecture Notes in Computer Science] Impl

[Lecture Notes in Computer Science] Implementation and Application of Automata Volume 6807 || Smaller Representation of Finite State Automata

✍ Bouchou-Markhoff, Béatrice; Caron, Pascal; Champarnaud, Jean-Marc; Maurel, Denis 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 259 KB

Computer implementation of automata for

Computer implementation of automata for electricity distribution control

✍ J.P Sabathe 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 863 KB

[Lecture Notes in Computer Science] Impl

[Lecture Notes in Computer Science] Implementation and Applications of Automata Volume 5148 || Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity

✍ Ibarra, Oscar H.; Ravikumar, Bala 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 507 KB

The 13th International Conference On Implementation And Application Of - Tomata (ciaa 2008) Was Held At San Francisco State University, San Francisco, July 21–24, 2008. This Volume Of Lecture Notes In Computer Science Contains The Papers That Were Presented At Ciaa 2008, As Well As The Abstracts Of

On the Computational Complexity of Finit

On the Computational Complexity of Finite Cellular Automata

✍ K. Sutner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

Efficient implementation of regular lang

Efficient implementation of regular languages using reversed alternating finite automata

✍ K. Salomaa; X. Wu; S. Yu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Alternating ÿnite automata (AFA) provide a natural and succinct way to denote regular languages. We introduce a bit-wise representation of reversed AFA (r-AFA) transition functions and describe an e cient implementation method for r-AFA and their operations using this representation. Experiments hav