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

On some bounded semiAFLs and AFLs

โœ Scribed by Paavo Turakainen

Book ID
107766428
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
904 KB
Volume
23
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on AFLs and bounded erasing
A note on AFLs and bounded erasing
โœ Ronald V. Book; Ben Wegbreit ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Elsevier Science โš– 530 KB
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,

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.

On some bounded domains
On some bounded domains
โœ K. Srinivasacharyulu ๐Ÿ“‚ Article ๐Ÿ“… 1965 ๐Ÿ› Springer-Verlag ๐ŸŒ French โš– 159 KB