@article{oai:miyazaki-u.repo.nii.ac.jp:00002370,
 author = {Sakamoto, Makoto and 坂本, 眞人 and Kawano, Hiroaki and Saito, Makoto},
 journal = {宮崎大学工学部紀要, Memoirs of Faculty of Engineering, University of Miyazaki},
 month = {Oct},
 note = {Abstract 
M.Blum and C.Hewitt first proposed two-dimensional automata as a computational model of two-
dimensional pattern processing, and investigated their pattern recognition abilities[1]. Since then, many 
researchers have been investigating a lot of properties about automata on a two-dimensional tape. However, 
there are a lot more open problems. For instance, it was unknown whether there exists a language accepted 
by a two-way nondeterministic one counter automaton, but not accepted by any deterministic rebound au-
tomaton. In this paper, we try to solve this problem, and show that there exists such a language.},
 pages = {339--342},
 title = {Two-Dimensional Input Tapes with One-Counter Languages Not Accepted by Deterministic Rebound Automata},
 volume = {33},
 year = {2004},
 yomi = {サカモト, マコト}
}