Non-closure Properties of 1-Inkdot Nondeterministic Turing Machines and Alternating Turing Machines with Only Universal States Using Small Space-Reference-Cited by-同舟云学术

Non-closure Properties of 1-Inkdot Nondeterministic Turing Machines and Alternating Turing Machines with Only Universal States Using Small Space

Published:2010 Issue:6 Volume:E93-A Page:1148-1152
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

YOSHINAGA Tsunehiro¹,XU Jianliang²,SAKAMOTO Makoto³

Affiliation:

1. Department of Computer Science and Electronic Engineering, Tokuyama College of Technology

2. Department of Computer Science, Ocean University of China

3. Department of Computer Science and Systems Engineering, Faculty of Engineering, University of Miyazaki

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

http://www.jstage.jst.go.jp/article/transfun/E93.A/6/E93.A_6_1148/_pdf

Reference11 articles.

1. [1] J.E. Hopcroft and J.D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, 1969.

2. [2] D. Ranjan, R. Chang, and J. Hartmanis, “Space bounded computations: Review and new separation results,” Theor. Comput. Sci., vol.80, pp.289-302, 1991.

3. Alternation

4. [4] A. Szepietowski, “Turing machines with sublogarithmic space,” Lect. Notes Comput. Sci., vol.843, Springer-Verlag, 1994.

5. [5] A. Ito, K. Inoue, and I. Takanami, “A note on alternating Turing machines using small space,” IEICE Trans., vol.E70, no.10, pp.990-996, Oct. 1987.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-Closure Properties of Multi-Inkdot Nondeterministic Turing Machines with Sublogarithmic Space;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2020-10-01