๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bounded monotone recursion and multihead automata

โœ Scribed by Marchenkov, S. S.

Book ID
125393864
Publisher
SP MAIK Nauka/Interperiodica
Year
2013
Tongue
English
Weight
202 KB
Volume
39
Category
Article
ISSN
0361-7688

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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