Skip to main content
Log in

A relationship between Turing machines and finite automata on four-dimensional input tapes

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

Due to the advances in computer animation, motion image processing, virtual reality systems, and so forth recently, it is useful for analyzing computation of multi-dimensional information processing to explicate the properties of four-dimensional automata. From this point of view, we first proposed four-dimensional automata in 2002, and investigated their several accepting powers. In this paper, we coutinue the study, and mainly concentrate on investigating the relationship between the accepting powers of four-dimensional finite automata and seven-way four-dimensional tape-bounded Turing Machines.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chandra AK, Kozen DC, Stockmeyer LJ (1981) Alternation. J Acm 28(1):114–133

    Article  MATH  MathSciNet  Google Scholar 

  2. Okatani S, Fukuda M, Sakamoto M, Furutani H (2007) A relationship between seven-way four-dimensional Turing machines and four-dimensional finite automata. In: Record of 2007 Joint Conference of Electrical and Electronics Engineers in Kyushu, Japan (CD-ROM)

  3. Sakamoto M, Okabe H, Inoue K (2002) Some properties of four-dimensional finite automata. In: 2002 Chugoku-Section Joint Convention Record of Institutes of Electrical and Information Engineerings, Japan, p 351

  4. Sakamoto M, Okabe H, Nogami S, Taniguchi S, Makino T, Nakama Y, Saito M, Kono M, Inoue K (2004) A note on four-dimensional finite automata. WSEAS Transactions on COMPUTERS 5(3):1651–1656

    Google Scholar 

  5. Sakamoto M, Ito T, Okatani S, Fukuda M, Furutani H, Inoue K (2007) A relationship between Turing machines and finite automata on four-dimensional input tapes. In: 2007 Chugoku-Section Joint Convention Record of Institutes of Electrical and Information Engineerings, Japan, 19/1–4 (CD-ROM)

  6. Taniguchi H, Inoue K, Takanami I (1982) A note on threedimensional finite automata. Information Sciences 26:65–85

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Makoto Sakamoto.

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

Sakamoto, M., Okatani, S., Fukuda, M. et al. A relationship between Turing machines and finite automata on four-dimensional input tapes. Artif Life Robotics 13, 58–60 (2008). https://doi.org/10.1007/s10015-008-0522-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-008-0522-8

Key words

Navigation