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

Tape-bounded turing acceptors and principal AFLs

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

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

No coin nor oath required. For personal study only.

โœฆ Synopsis

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, and introductory concepts are presented only in Ref. [1]. It is assumed here that the reader is familiar with the results of Ref. [1].

The purpose of this paper is to provide conditions for a function f such that the family of languages accepted by nondeterministic (deterministic) Turing acceptors which operate within tape bound f forms a principal AFL.

๐Ÿ“œ SIMILAR VOLUMES

Time- and tape-bounded turing acceptors
Time- and tape-bounded turing acceptors and AFLs
โœ Ronald V. Book; Sheila A. Greibach; Ben Wegbreit ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 763 KB

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.