An Algebraic Characterization of Unary Two-Way Transducers

  • Christian Choffrut
  • Bruno Guillon
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berstel, J.: Transductions and context-free languages. B. G. Teubner (1979)Google Scholar
  2. 2.
    Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press (1974)Google Scholar
  3. 3.
    Elgot, C.C., Mezei, J.E.: On Relations Defined by Finite Automata. IBM Journal 10, 47–68 (1965)CrossRefMathSciNetGoogle Scholar
  4. 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)CrossRefMATHMathSciNetGoogle Scholar
  5. 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. 6.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)Google Scholar
  7. 7.
    Parikh, R.: On context-free languages. J. ACM 13(4), 570–581 (1966)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 114–125 (1959)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)Google Scholar
  10. 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)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2014

Authors and Affiliations

  • Christian Choffrut
    • 1
  • Bruno Guillon
    • 1
  1. 1.LIAFACNRS and Université Paris 7 Denis DiderotFrance

Personalised recommendations