𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Deterministic one-dimensional cellular automata

✍ Scribed by N. Pitsianis; Ph. Tsalides; G. L. Bleris; A. Thanailakis; H. C. Card


Publisher
Springer
Year
1989
Tongue
English
Weight
533 KB
Volume
56
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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.