@article{(Open Science Index):https://publications.waset.org/pdf/6351,
	  title     = {Hierarchies Based On the Number of Cooperating Systems of Finite Automata on Four-Dimensional Input Tapes},
	  author    = {Makoto Sakamoto and  Yasuo Uchida and  Makoto Nagatomo and  Takao Ito and Tsunehiro Yoshinaga and Satoshi Ikeda and Masahiro Yokomichi and  Hiroshi Furutani},
	  country	= {},
	  institution	= {},
	  abstract     = {In theoretical computer science, the Turing machine has played a number of important roles in understanding and exploiting basic concepts and mechanisms in computing and information processing [20]. It is a simple mathematical model of computers [9]. After that, 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 in 1967 [7]. Since then, a lot of researchers in this field have been investigating many properties about automata on a two- or three-dimensional tape. On the other hand, the question of whether processing fourdimensional digital patterns is much more difficult than two- or threedimensional ones is of great interest from the theoretical and practical standpoints. Thus, the study of four-dimensional automata as a computasional model of four-dimensional pattern processing has been meaningful [8]-[19],[21]. This paper introduces a cooperating system of four-dimensional finite automata as one model of four-dimensional automata. A cooperating system of four-dimensional finite automata consists of a finite number of four-dimensional finite automata and a four-dimensional input tape where these finite automata work independently (in parallel). Those finite automata whose input heads scan the same cell of the input tape can communicate with each other, that is, every finite automaton is allowed to know the internal states of other finite automata on the same cell it is scanning at the moment. In this paper, we mainly investigate some accepting powers of a cooperating system of eight- or seven-way four-dimensional finite automata. The seven-way four-dimensional finite automaton is an eight-way four-dimensional finite automaton whose input head can move east, west, south, north, up, down, or in the fu-ture, but not in the past on a four-dimensional input tape.
},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {6},
	  number    = {12},
	  year      = {2012},
	  pages     = {1707 - 1712},
	  ee        = {https://publications.waset.org/pdf/6351},
	  url   	= {https://publications.waset.org/vol/72},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 72, 2012},
	}