Abstract
A multi-marker automaton is a finite automaton which keeps marks as pebbles in the finite control, and cannot rewrite any input symbols but can make marks on its input with the restriction that only a bounded number of these marks can exist at any given time. An improvement of picture recognizability of the finite automaton is the reason why the multi-marker automaton was introduced. On the other hand, a multi-inkdot automaton is a conventional automaton capable of dropping an inkdot on a given input tape for a landmark, but unable to further pick it up. This paper deals with marker versus inkdot over threedimensional input tapes, and investigates some properties.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blum M, Hewitt C (1967) Automata on a two-dimensional tape. In: IEEE Symposium on Switching and Automata Theory, pp 155–160
Inoue A, Inoue K, Ito A, Wang Y, Okazaki T (2004) A note on one-pebble two-dimensional Turing machines. Information Sciences 162:295–314
Inoue A, Ito A, Hiraishi K, Inoue K (2004) Alternating inkdot is better than nondeterministic pebble over two-dimensional languages. In: The 3rd International Conference on Information, (INFO’2004)
Inoue A, Ito A, Inoue K (2004) Inkdot versus pebble over picture languages. In: 2004 Chugoku-Section Joint Connection Record of Institutes of Electrical and Information Engineerings, Japan, pp 251–252
Ito A, Inoue K, Takanami I, Wang Y (1995) The effect of inkdot for two-dimensional automata. International Journal of Pattern Recognition and Artificial Intelligence 9(5):777–796
Ranjan D, Chang R, Hartmanis J (1991) Space bounded computations: review and new separation results. Theoretical Computer Science 80:289–302
Makino T, Sakamoto M, Inoue K, Furutani H, Katayama S (2004) Some note on three-dimensional multi-inkdot automata. In: Record of 2004 Joint Conference of Electrical and Electronics Engineerings in Kyushu, Japan, No.12-1A11 (CD-ROM)
Makino T, Okabe H, Taniguchi S, Sakamoto M, Inoue K (2005) Three-dimensional multi-inkdot automata. Artifi Life Robotics 9(2):99–101
Sakamoto M, Ito A, Takanami I (1994) Simulation of threedimensional 1-marker automata by five-way Turing machines. Information Sciences 77:77–99
Sakamoto M, Inoue K, Ito A (1996) Recognizability of connected pictures by three-dimensional multi-inkdot finite automata. In: 1996 Chugoku-Section Joint Convention Record of Institutites of Electrical and Information Engineerings, Japan, p 289
Sakamoto M, Inoue K, Ito A (1997) Basic properties of threedimensional multi-inkdot automata. In: 1997 IEICE General Conference, p 5
Sakamoto M, Inoue K, Ito A (1999) Some properties of threedimensional multi-inkdot automata. In: 1999 Chugoku-Section Joint Convention Record of Institutites of Electrical and Information Engineerings, Japan, pp 219–220
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008
About this article
Cite this article
Ito, T., Sakamoto, M., Okabe, H. et al. Marker versus inkdot over three-dimensional patterns. Artif Life Robotics 13, 65–68 (2008). https://doi.org/10.1007/s10015-008-0524-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-008-0524-6