𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounded quantification and relations recognizable by finite automata

✍ Scribed by Teuvo Laurinolli

Publisher
Springer-Verlag
Year
1978
Tongue
English
Weight
578 KB
Volume
10
Category
Article
ISSN
0001-5903

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