Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Reversible Computation

RC 2012: Reversible Computation pp 29–43Cite as

A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7581))

Abstract

A two-way multi-head finite automaton (MFA) is a variant of a finite automaton consisting of a finite-state control, a finite number of heads that can move in two directions, and a read-only input tape. Here, we show that for any given deterministic MFA we can construct a reversible MFA with the same number of heads that accepts the same language as the former. We then apply this conversion method to a Turing machine. By this, we can obtain, in a simple way, an equivalent reversible Turing machine that is garbage-less, uses the same number of tape symbols, and uses the same amount of the storage tape.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Axelsen, H.: Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 95–105. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)

    Article  MATH  Google Scholar 

  3. Blum, M., Hewitt, C.: Automata on a two-dimensional tape. In: Proc. IEEE Symp. on Switching and Automata Theory, pp. 155–160. IEEE (1967)

    Google Scholar 

  4. Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoret. Comput. Sci. 412, 83–96 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proc. 36th FOCS, pp. 66–75. IEEE (1997)

    Google Scholar 

  6. Lange, K.J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. Syst. Sci. 60, 354–367 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Morita, K.: Two-way reversible multi-head finite automata. Fundamenta Informaticae 110, 241–254 (2011)

    MathSciNet  MATH  Google Scholar 

  8. Sipser, M.: Halting space-bounded computations. Theoret. Comput. Sci. 10, 335–338 (1980)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, Hiroshima University, Higashi-Hiroshima, 739-8527, Japan

    Kenichi Morita

Authors
  1. Kenichi Morita
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DIKU, Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100, Copenhagen, Denmark

    Robert Glück

  2. Department of Software Engineering, Nanzan University, 489-0863, Seto, Japan

    Tetsuo Yokoyama

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morita, K. (2013). A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads. In: Glück, R., Yokoyama, T. (eds) Reversible Computation. RC 2012. Lecture Notes in Computer Science, vol 7581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36315-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36315-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36314-6

  • Online ISBN: 978-3-642-36315-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation