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

Time- and tape-bounded turing acceptors and AFLs

โœ Scribed by Ronald V. Book; Sheila A. Greibach; Ben Wegbreit

Publisher
Elsevier Science
Year
1970
Tongue
English
Weight
763 KB
Volume
4
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

โœฆ Synopsis

Complexity classes of formal languages defined by time-and tape-bounded Turing acceptors are studied. Sufficient conditions for these classes to be AFLs are given. Further, it is shown that a time-bounded nondeterministic Turing acceptor need have only two storage tapes.

๐Ÿ“œ SIMILAR VOLUMES

Tape-bounded turing acceptors and princi
Tape-bounded turing acceptors and principal AFLs
โœ Ronald V. Book; Sheila A. Greibach; Oscar H. Ibarra; Ben Wegbreit ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 187 KB

Conditions are given under which the classes of formal languages defined by nondeterministic (deterministic) tape-bounded Turing acceptors will be principal AFLs. This paper is a sequel to the immediately preceding paper (see Ref. [1]). 1 To avoid unnecessary duplication, the terminology, notation,

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

Acceptor bound biexcitons in ZnSe and Cd
Acceptor bound biexcitons in ZnSe and CdS
โœ V. Kutzer; B. Lummer; R. Heitz; A. Hoffmann; I. Broser; E. Kurtz; D. Hommel ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 304 KB