References
- Baker, B., Book, R.: Reversal-bounded multipushdown machines., 8(1974), 315-332.
- Greibach, S.: Remarks on the complexity of nondeterministic counter languages,, 1(1976), 269-288.
- Harrison, M., Ibarra, O.: Multi-tape and multi-heads pushdown automata., 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,, 25(1), (1978).
- Ibarra, O., Ravikumar, B.: On partially blind multihead finite automata,, 365(1), (2006), 190-199.
- Jenner, B.: Knapsack problems for NL,, 54(3), (1995), 169-174.
- Sudborough, I.: A note on tape-bounded complexity clases and linear contex-free languages,, 22(4), (1975), 499-500.
- Yao, A., Rivest, R.: k+1 heads are better than k,, 25(2), (1978), 337-340.
DOI: https://doi.org/10.2478/v10294-012-0003-5 | Journal eISSN: 1339-0015 (formerly 1336-9180) | Journal ISSN: 1336-9180
Language: English
Page range: 33 - 41
Published on: Aug 13, 2012
Published by: University of Ss. Cyril and Methodius in Trnava
In partnership with: Paradigm Publishing Services
Related subjects:
© 2012 Pavol Ďuriš, published by University of Ss. Cyril and Methodius in Trnava
This work is licensed under the Creative Commons License.