Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Uniformisation of Two-Way Transducers

  • Conference paper
Language and Automata Theory and Applications (LATA 2013)

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

Abstract

We show that every relation realised by a nondeterministic two-way transducer contains a function with equal domain which can be realised by a sequential two-way transducer. Our proof is built on three structural constructions with automata: a variant of Shepherdson’s method to convert a two-way automaton into an equivalent one-way automaton, which we call the folding of a two-way automaton; the construction of an unambiguous automaton for a rational language based on covering of automata; a simulation of an unambiguous automaton by a deterministic two-way one due to Hopcroft and Ullman. It follows a new proof for the fact (due to Engelfriet and Hoogeboom) that every functional two-way transducer can be converted into a sequential one, together with a clear estimation for the underlying complexity.

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. Choffrut, C.: Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles. Theoretical Computer Science 5(3), 325–337 (1977), http://dx.doi.org/10.1016/0304-39757790049-4

    Article  MathSciNet  Google Scholar 

  2. Choffrut, C., Grigorieff, S.: Uniformization of rational relations. In: Jewels are Forever, pp. 59–71. Springer (1999)

    Google Scholar 

  3. Culik, K., Karhumaki, J.: The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable. SIAM Journal on Computing 16(2), 221–230 (1987), http://dx.doi.org/10.1137/0216018

    Article  MathSciNet  MATH  Google Scholar 

  4. Elgot, C.C., Mezei, J.E.: On Relations Defined by Generalized Finite Automata. IBM Journal of Research and Development 9(1), 47–68 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  5. Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Logic 2(2), 216–254 (2001), http://dx.doi.org/10.1145/371316.371512

    Article  MathSciNet  MATH  Google Scholar 

  6. Gurari, E.M.: The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable. SIAM Journal on Computing 11(3), 448–452 (1982), http://dx.doi.org/10.1137/0211035

    Article  MathSciNet  MATH  Google Scholar 

  7. Hopcroft, J.E., Ullman, J.D.: An approach to a unified theory of automata. In: 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), pp. 140–147. IEEE Computer Society (1967)

    Google Scholar 

  8. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979), http://www.worldcat.org/oclc/4549363

  9. Kobayashi, K.: Classification of formal languages by functional binary transductions. Information and Control 15(1), 95–109 (1969), http://dx.doi.org/10.1016/S0019-99586990651-2

    Article  MathSciNet  MATH  Google Scholar 

  10. Lombardy, S., Sakarovitch, J.: Sequential? Theoretical Computer Science 356(1-2), 224–244 (2006), http://dx.doi.org/10.1016/j.tcs.2006.01.028

    Article  MathSciNet  MATH  Google Scholar 

  11. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114–125 (1959), http://dx.doi.org/10.1147/rd.32.0114

    Article  MathSciNet  Google Scholar 

  12. Rajlich, V.: Absolutely parallel grammars and two-way finite-state transducers. Journal of Computer and System Sciences 6(4), 324–342 (1972), http://dx.doi.org/10.1016/S0022-00007280025-4

    Article  MathSciNet  MATH  Google Scholar 

  13. Sakarovitch, J.: A construction on finite automata that has remained hidden. Theoretical Computer Science 204(1-2), 205–231 (1998), http://dx.doi.org/10.1016/S0304-39759800040-1

    Article  MathSciNet  MATH  Google Scholar 

  14. Sakarovitch, J.: Elements of Automata Theory. Cambdrige University Press (2009)

    Google Scholar 

  15. Sakarovitch, J., de Souza, R.: Lexicographic decomposition of k-valued transducers. Theory of Computing Systems 47(3), 758–785 (2010), http://dx.doi.org/10.1007/s00224-009-9206-6

    Article  MathSciNet  MATH  Google Scholar 

  16. Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3, 198–200 (1959), http://dx.doi.org/10.1147/rd.32.0198

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEINFO/EADTec, Universidade Federal Rural de Pernambuco, Recife, Brazil

    Rodrigo de Souza

Authors
  1. Rodrigo de Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. Fakultät für Informatik, Institut für Wissens- und Sprachverarbeitung, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Souza, R. (2013). Uniformisation of Two-Way Transducers. In: Dediu, AH., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2013. Lecture Notes in Computer Science, vol 7810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37064-9_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37064-9_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37063-2

  • Online ISBN: 978-3-642-37064-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation