A Note on Non-Closure Property of Sublogarithmic Space-Bounded 1-Inkdot Alternating Pushdown Automata with Only Existential (Universal) States
暂无分享,去创建一个
[1] Oscar H. Ibarra,et al. Some Observations Concerning Alternating Turing Machines Using Small Space , 1987, Inf. Process. Lett..
[2] Jianliang Xu,et al. Alternation for sublogarithmic space-bounded alternating pushdown automata , 2001, Theor. Comput. Sci..
[3] Maciej Liskiewicz,et al. The Sublogarithmic Alternating Space World , 1996, SIAM J. Comput..
[4] Viliam Geffert. Nondeterministic Computations in Sublogarithmic Space and Space Constructibility , 1991, SIAM J. Comput..
[5] I. Takanami,et al. A note on alternating turing machines using small space , 1987 .
[6] Andrzej Szepietowski. Turing Machines with Sublogarithmic Space , 1994, Lecture Notes in Computer Science.
[7] Katsushi Inoue,et al. On 1-inkdot Alternating Turing Machines with Small Space , 1994, Theor. Comput. Sci..
[8] J. Xu. On 1-Inkdot Alternating Pushdown Automata with Sublogarithmic Space , 2003 .
[9] Katsushi Inoue,et al. A Note on Multi-Inkdot Nondeterministic Turing Machines with Small Space , 1993, Inf. Process. Lett..
[10] Jianliang Xu,et al. A Note on Alternating Pushdown Automata with Sublogarithmic Space , 1995 .
[11] Desh Ranjan,et al. Space Bounded Computations: Review and New Separation Results , 1991, Theor. Comput. Sci..