Four-dimensional multi-inkdot finite automata

  • Authors:

  • Yasuo Uchida;Takao Ito;Hidenobu Okabe;Makoto Sakamoto;Hiroshi Furutani;Michio Kono

  • Affiliations:

  • Ube National College of Technology, Dept. of Business Administration, Tokiwadai Ube City, Japan;Ube National College of Technology, Dept. of Business Administration, Tokiwadai Ube City, Japan;Nittetsu Hitachi Systems Engineering, Inc., Financial Solutions Division, Akashi-Chou, Chuou-Ku, Tokyo, Japan;University of Miyazaki, Faculty of Engineering, Miyazaki City, Japan;University of Miyazaki, Faculty of Engineering, Miyazaki City, Japan;University of Miyazaki, Faculty of Engineering, Kibanadai Nishi, Miyazaki City, Japan

  • Venue:
  • WSEAS Transactions on Computers
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

During the past about thirty-five years, many automata on a two- or three-dimensional input tape have been proposed and a lot of properties of such automata have been obtained. On the other hand, we think that recently, due to the advances in computer animation, motion image processing, and so forth, it is very useful for analyzing computational complexity of multi-dimensional information processing to explicate the properties of four-dimensional automata, i.e., three-dimensional automata with the time axis. In this paper, we propose a four-dimensional multi-inkdot finite automaton and mainly investigate its recognizability of four-dimensional connected pictures. Moreover, we briefly investigate some basic accepting powers of four-dimensional multi-inkdot finite automata.