References
- Baker, B., Book, R.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences, 8(1974), 315-332.
- Greibach, S.: Remarks on the complexity of nondeterministic counter languages, Theoretical Computer Science, 1(1976), 269-288.
- Harrison, M., Ibarra, O.: Multi-tape and multi-heads pushdown automata. Information and Control, 13(1968), 433-470.
- Hopcroft, J., Ullman, J.: Introduction to Automata, Formal Languages and Theory of Computation, Addision-Wesley, Inc. Reading, MA (1979).
- Ibarra, O.: Reversal -bounded counter machines and their decision problems, Journal of the ACM, 25(1), (1978).
- Ibarra, O., Ravikumar, B.: On partially blind multihead finite automata, Theoretical Computer Science, 365(1), (2006), 190-199.
- Jenner, B.: Knapsack problems for NL, Information Processing Letters, 54(3), (1995), 169-174.
- Sudborough, I.: A note on tape-bounded complexity clases and linear contex-free languages, Journal of the ACM, 22(4), (1975), 499-500.
- Yao, A., Rivest, R.: k+1 heads are better than k, Journal of the ACM, 25(2), (1978), 337-340.