Skip to main content
SpringerLink
Log in

Path-bounded three-dimensional finite automata

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

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

The comparative study of the computational powers of deterministic and nondeterministic computations is one of the central tasks in complexity theory. This paper investigates the computational power of nondeterministic computing devices with restricted nondeterminism. There are only few results measuring the computational power of restricted nondeterminism. In general, there are three possibilities to measure the amount of nondeterminism in computation. In this paper, we consider the possibility to count the number of different nondeterministic computation paths on any input. In particular, we deal with five-way three-dimensional finite automata with multiple input heads operating on three-dimensional input tapes.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Diaz J, Toran J (1990) Classes of bounded nondeterminism. Mathematical Systems Theory 23:21–32

    Article  MATH  MathSciNet  Google Scholar 

  2. Duris P, Hromkovič J, Inoue K (2000) A separation of determinism, Las Vegas and nondeterminism for picture recognition, In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pp 214–228

  3. Hromkovič J, Schnitger G (1996) Nondeterministic communication with a limited number of advice bits. In: Proceedings of STOC’ 96, ACM, pp 551–560

  4. Hromkovič J, Karhumäki J, Klauck H, Schnitger G, Seibert S (2000) Measures of nondeterminism in finite automata. ECCC Report, TR00-076

  5. Inoue K, Takanami I, Taniguchi H (1979) Three-way two-dimensional simple multihead finite automata — Hierarchical properties — Trans IECE’ 79/2, 62(2):65–72

    Google Scholar 

  6. Inoue S (2003) A study of Path-bounded multihead finite automata. Master Graduate School of Yamaguchi University

  7. Inoue S, Inoue K, Ito A, Wang Y (2003) Path-bounded three-way two-dimensional finite automata. In: 2003 Chugoku-Section Joint Convention Record of Institute of Electrical and Information Engineerings, Japan, pp 262–263

  8. Sakamoto M, Ito T, Tomozoe N, Furutani H (2007) A survey of three-dimensional automata. The papers of technical meeting on information systems, IEE, Japan, IS-07-12, pp 11–17

  9. Taniguchi H, Inoue K, Takanami I (1982) A note on three-dimensional finite automata. Information Sciences 26:65–85

    Article  MATH  MathSciNet  Google Scholar 

  10. Yao AC, Rivest RL (1978) k + 1 heads are better than k. J ACM 25(2):337–340

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Systems Engineering, University of Miyazaki, Miyazaki, 889-2192, Japan

    Makoto Sakamoto, Masatsugu Fukuda, Satoshi Okatani, Hiroshi Furutani & Michio Kono

  2. Department of Business Administration, Ube National College of Technology, Ube, Japan

    Takao Ito

Authors
  1. Makoto Sakamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masatsugu Fukuda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Satoshi Okatani
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Takao Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hiroshi Furutani
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Michio Kono
    View author publications

    You can also search for this author in PubMed Google Scholar

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., Fukuda, M., Okatani, S. et al. Path-bounded three-dimensional finite automata. Artif Life Robotics 13, 54–57 (2008). https://doi.org/10.1007/s10015-008-0521-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-008-0521-9

Key words

Search

Navigation