Author:
Kutrib Martin,Wendlandt Matthias
Publisher
Springer International Publishing
Reference26 articles.
1. Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: Symposium on Switching and Automata Theory (SWAT 1967), pp. 155–160. IEEE (1967)
2. Ellul, K.: Descriptional Complexity Measures of Regular Languages. Master’s thesis. University of Waterloo, Ontario, Canada (2004)
3. Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theoret. Comput. Sci. 295, 189–203 (2003)
4. Hartmanis, J.: Computational complexity of one-tape Turing machine computations. J. ACM 15, 325–339 (1968)
5. Hennie, F.C.: One-tape, off-line Turing machine computations. Inform. Control 8, 553–578 (1965)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献