𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On stateless deterministic restarting automata

✍ Scribed by Martin Kutrib; Hartmut Messerschmidt; Friedrich Otto

Book ID
105930948
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
267 KB
Volume
47
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] SOFS
[Lecture Notes in Computer Science] SOFSEM 2009: Theory and Practice of Computer Science Volume 5404 || On Stateless Deterministic Restarting Automata
✍ Nielsen, Mogens; Kučera, Antonín; Miltersen, Peter Bro; Palamidessi, Catuscia; T 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 221 KB

This book constitutes the refereed proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2009, held in Špindleruv Mlýn, Czech Republic, in January 2009. The 49 revised full papers, presented together with 9 invited contributions, were carefully revie

Deterministic one-counter automata
Deterministic one-counter automata
✍ Leslie G. Valiant; Michael S. Paterson 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 471 KB

The equivalence problem for deterministic one-counter automata is shown to be decidable. A corollary for schema theory is that equivalence is decidable for Ianov schemas with an auxiliary counter.