Reversal-bounded multipushdown machines
β
Brenda S. Baker; Ronald V. Book
π
Article
π
1974
π
Elsevier Science
π
English
β 1001 KB
Several representations of the recursively enumerable (r.e.) sets are presented. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. The second states that every r.e. set is accepted by an on-line Turing acceptor with two pushdown s