𝔖 Bobbio Scriptorium
✦   LIBER   ✦

One-way weak-stack-counter automata

✍ Scribed by Satoru Miyano

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
994 KB
Volume
20
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Checking automata and one-way stack lang
Checking automata and one-way stack languages
✍ Sheila Greibach πŸ“‚ Article πŸ“… 1969 πŸ› Elsevier Science 🌐 English βš– 837 KB

A checking automaton is equivalent to a one-way nonerasing stack automaton which, once it enters its stack, never again writes on its stack. The checking automaton languages (cal) form a full AFL closed under substitution. If L C a\* is an infinite cal, then L contains an infinite regular set. Conse

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.

Multitape one-way nonwriting automata
Multitape one-way nonwriting automata
✍ Patrick C. Fischer; Arnold L. Rosenberg πŸ“‚ Article πŸ“… 1968 πŸ› Elsevier Science 🌐 English βš– 591 KB

The theory given by Rabin and Scott for one-tape finite automata is extended to cover machines with several input tapes which can be advanced independently under finite-state control.

Fast one-way cellular automata
Fast one-way cellular automata
✍ Andreas Klein; Martin Kutrib πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 333 KB

Space-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion known to be strict in their time hierarchy from real-time to exponential-time is between real-time and linear-time! We show the surprising result that there exists an inΓΏnite hierarchy of properly included O