Skip to main content
SpringerLink
Log in
SpringerLink
Log in

The simulation of two-dimensional one-marker automata by three-way turing machines

  • Chapter 2 Machines
  • Conference paper
  • First Online:
Machines, Languages, and Complexity (IMYCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 381))

Included in the following conference series:

Abstract

We denote a two-dimensional deterministic (nondeterministic) one-marker automaton by "2-DM1" ("2-NM1"), and a three-way two-dimensional deterministic (nondeterministic) Turing machine by "TR2-DTM" ("TR2-NTM"). In this paper, we show that the necessary and sufficient space for TR2-NTM's to simulate 2-DM1's (2-NM1's) is nlogn (n 2), and the necessary and sufficient space for TR2-DTM's to simulate 2-DM1's (2-NM1's) is 2o(nlogn) (2o(n2)), where n is the number of columns of rectangular input tapes.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.Blum and C.Hewitt, Automata on a 2-dimensional Tape, Proceedings of the 8th IEEE symposium of Switching and Automata Theory, pp.155–160 (1967).

    Google Scholar 

  2. A.Rosenfeld, Picture Languages — Formal models for Picture Recognition, Academic Press (1979).

    Google Scholar 

  3. K. Inoue and A. Nakamura, Some Properties of Two-Dimensional Nondeterministic Finite Automata and Parallel Sequential Array Acceptors, The Transactions of the Institute of Electronics and Communication Engineers of Japan Vol.60-D, No.11, pp.990–997 (1977).

    Google Scholar 

  4. K. Morita, H. Umeo, and K. Sugata, Accepting Abilities of Offside-free Two-dimensional Marker Automata — The simulation of Four-way Automata by Three-way Tape-bounded Turing Machines, The Technical Reports of the Institute of Electronics and Communication Engineers of Japan Vol.AL79,No.19,pp.1–10(1979).

    Google Scholar 

  5. K. Inoue and A. Nakamura, Some Properties of Two-Dimensional On-Line Tessellation Acceptors, Information Sciences 13, pp.95–121 (1977).

    Google Scholar 

  6. K. Inoue and I. Takanami, A Note on Deterministic Three-Way Tape-Bounded Two-Dimensional Turing Machines, Information Sciences 20, pp.41–55 (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technical College, Yamaguchi University, 755, Ube, Japan

    Akira Ito

  2. Faculty of Engineering, Yamaguchi University, 755, Ube, Japan

    Katsushi Inoue & Itsuo Takanami

Authors
  1. Akira Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Katsushi Inoue
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Itsuo Takanami
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Dassow J. Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ito, A., Inoue, K., Takanami, I. (1989). The simulation of two-dimensional one-marker automata by three-way turing machines. In: Dassow, J., Kelemen, J. (eds) Machines, Languages, and Complexity. IMYCS 1988. Lecture Notes in Computer Science, vol 381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015930

Download citation

  • DOI: https://doi.org/10.1007/BFb0015930

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51516-6

  • Online ISBN: 978-3-540-48203-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation