𝔖 Bobbio Scriptorium
✦   LIBER   ✦

One-way multihead deterministic finite automata

✍ Scribed by J. Hromkovič

Publisher
Springer-Verlag
Year
1983
Tongue
English
Weight
392 KB
Volume
19
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On two-way multihead automata
On two-way multihead automata
✍ Oscar H. Ibarra 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 479 KB

For each positive integer n, let -~eN(n ) be the class of sets accepted by a family of automata of type N, each with a read-only input with endmarkers and n two-way input heads. The following result, which is applicable to most types of two-way multihead devices, is proved: If for each positive inte

On tape-bounded complexity classes and m
On tape-bounded complexity classes and multihead finite automata
✍ I.H. Sudborough 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 798 KB

The principal result described in this paper is the equivalence of the following statements : (1) Every set accepted by a nondeterministic one-way two-head finite automaton can be accepted by a deterministic two-way k-head finite automaton, for some k. (2) The context-free language Lp (described i

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.