𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Descriptional and computational complexity of finite automata—A survey

✍ Scribed by Markus Holzer; Martin Kutrib


Book ID
113641946
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
377 KB
Volume
209
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


[Lecture Notes in Computer Science] Impl
✍ 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
✍ 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

[Lecture Notes in Computer Science] Deve
✍ Harju, Tero; Karhumäki, Juhani; Lepistö, Arto 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 361 KB

This book constitutes the refereed proceedings of the 11th International Conference on Developments in Language Theory, DLT 2007, held in Turku, Finland in July 2007. It addresses all important issues in language theory including grammars, acceptors and transducers for words, trees and graphs; algeb