Publisher
Springer International Publishing
Reference6 articles.
1. Condon, A.: The complexity of space bounded interactive proof systems. In: Ambos-Spies, A., et al. (eds.) Complexity Theory: Current Research, pp. 147–189. Cambridge University Press, Cambridge (1992).
https://www.cs.ubc.ca/~condon/papers/ips-survey.pdf
2. Hartmanis, J.: On non-determinancy in simple computing devices. Acta Informatica 1(4), 336–344 (1972).
https://doi.org/10.1007/BF00289513
3. Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: origins and directions. Theoret. Comput. Sci. 412(1–2), 83–96 (2011).
https://doi.org/10.1016/j.tcs.2010.08.024
4. Monien, B.: Transformational methods and their application to complexity problems. Acta Informatica 6(1), 95–108 (1976).
https://doi.org/10.1007/BF00263746
5. Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO Informatique Théorique 14(1), 67–82 (1980).
https://doi.org/10.1051/ita/1980140100671
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献