Skip to main content
SpringerLink
Log in

An Algebraic Characterization of Unary Two-Way Transducers

  • Conference paper
Mathematical Foundations of Computer Science 2014 (MFCS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8634))

Abstract

Two-way transducers are ordinary finite two-way automata that are provided with a one-way write-only tape. They perform a word to word transformation. Unlike one-way transducers, no characterization of these objects as such exists so far except for the deterministic case. We study the other particular case where the input and output alphabets are both unary but when the transducer is not necessarily deterministic. This yields a family which extends properly the rational relations in a very natural manner. We show that deterministic two-way unary transducers are no more powerful than one-way transducers.

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

Access this chapter

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 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J.: Transductions and context-free languages. B. G. Teubner (1979)

    Google Scholar 

  2. Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press (1974)

    Google Scholar 

  3. Elgot, C.C., Mezei, J.E.: On Relations Defined by Finite Automata. IBM Journal 10, 47–68 (1965)

    Article  MathSciNet  Google Scholar 

  4. Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2), 216–254 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Filiot, E., Gauwin, O., Reynier, P.A., Servais, F.: From two-way to one-way finite state transducers. In: LICS, pp. 468–477 (2013)

    Google Scholar 

  6. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)

    Google Scholar 

  7. Parikh, R.: On context-free languages. J. ACM 13(4), 570–581 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  8. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 114–125 (1959)

    Article  MathSciNet  Google Scholar 

  9. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)

    Google Scholar 

  10. Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM Journal of Research and Development Archive 3, 198–200 (1959)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, CNRS and Université Paris 7 Denis Diderot, France

    Christian Choffrut & Bruno Guillon

Authors
  1. Christian Choffrut
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruno Guillon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Eötvös Loránd University, Pázmány Péter sétány 1/C, 1117, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  2. Fakultät für Informatik und Automatisierung, Technische Universität Ilmenau, Helmholtzplatz, 598693, Ilmenau, Germany

    Martin Dietzfelbinger

  3. Institute of Informatics, Szeged University, Tisza Lajos krt. 103, 6720, Szeged, Hungary

    Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Choffrut, C., Guillon, B. (2014). An Algebraic Characterization of Unary Two-Way Transducers. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44522-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44522-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44521-1

  • Online ISBN: 978-3-662-44522-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation