Question: [38] A k-head PDA (k-PDA) is similar to a pushdown automaton except that it has k input heads. Prove that k + 1 heads are
[38] A k-head PDA (k-PDA) is similar to a pushdown automaton except that it has k input heads. Prove that k + 1 heads are better than k heads for PDAs. That is, prove that there is a language that is accepted by a (k + 1)-PDA but not by any k-PDA.
Comments. Conjectured by M.A. Harrison and O.H. Ibarra [Inform.
Contr., 13(1968), 433–470] in analogy to Exercise 6.9.1.
Partial solutions were obtained by S. Miyano [Acta Informatica, 17(1982), 63–67;
J. Comput. System Sci., 27(1983), 116–124]; and M. Chrobak [Theoret. Comput. Sci., 48(1986), 153–181]. The complete solution, using incompressibility, is in [M. Chrobak and M. Li, J. Comput. System Sci., 37:2(1988), 144–155].
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
