Skip to main content
SpringerLink
Log in

Weighted Two-Way Transducers

  • Conference paper
  • First Online:
Algebraic Informatics (CAI 2022)

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

Included in the following conference series:

  • 279 Accesses

Abstract

Weighted two-way transducers over complete commutative semirings are introduced and investigated. Their computed mappings have two-way definable support. Conversely, for every two-way definable relation R there exists a mapping computable by a weighted two-way transducer whose support is R. It is shown that the class of all such computed mappings is closed under sum and the subclass computed by deterministic weighted two-way transducers is closed under composition.

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 EPUB and 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

References

  1. Berstel, J.: Transductions and Context-free Languages. Teubner-Verlag (1979). https://doi.org/10.1007/978-3-663-09367-1

  2. Carnino, V., Lombardy, S.: On determinism and unambiguity of weighted two-way automata. In: Ésik, Z., Fülöp, Z. (eds.) Proceedings 14th International Conference Automata and Formal Languages. Electronic Proceedings of Theoretical Computer Science, vol. 151, pp. 188–200. arXiv (2014). https://doi.org/10.4204/EPTCS.151.13

  3. Dartois, L., Fournier, P., Jecker, I., Lhote, N.: On reversible transducers. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) Proceedings– Leibniz-Zentrum für Informatik (2017). https://doi.org/10.4230/LIPIcs.ICALP.2017.113

  4. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with \(n\) distinct prime factors. Am. J. Math. 35(4), 413–422 (1913). https://doi.org/10.2307/2370405

    Article  MathSciNet  MATH  Google Scholar 

  5. Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 513–525. Springer, Heidelberg (2005). https://doi.org/10.1007/11523468_42

    Chapter  MATH  Google Scholar 

  6. Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science, Springer (2009). https://doi.org/10.1007/978-3-642-01492-5

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Fülöp, Z., Maletti, A., Vogler, H.: Weighted extended tree transducers. Fund. Inform. 111(2), 163–202 (2011). https://doi.org/10.3233/FI-2011-559

    Article  MathSciNet  MATH  Google Scholar 

  9. Golan, J.S.: Semirings and their Applications. Kluwer Academic, Dordrecht (1999). https://doi.org/10.1007/978-94-015-9333-5

  10. Goldstern, M.: Completion of semirings. Master’s thesis, TU Wien (1985). https://doi.org/10.48550/arXiv.math/0208134

  11. Hebisch, U., Weinert, H.J.: Semirings – algebraic theory and applications in computer science. World Sci. (1998). https://doi.org/10.1142/3903

    Article  MATH  Google Scholar 

  12. Kirsten, D.: The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. Acta Cybernetica 20(2), 211–221 (2011). https://doi.org/10.14232/actacyb.20.2.2011.1

  13. Lombardy, S.: Two-way representations and weighted automata. RAIRO Theor. Inf. Appl. 50(4), 331–350 (2016). https://doi.org/10.1051/ita/2016026

    Article  MathSciNet  MATH  Google Scholar 

  14. Maletti, A., Nász, A.: Weighted tree automata with constraints. In: Diekert, V., Volkov, M.V. (eds.) Proceedings 26th International Conference Developments in Language Theory. Lecture Notes in Computer Science, vol. 13257, pp. 226–238. Springer (2022). https://doi.org/10.1007/978-3-031-05578-2_18

  15. Muscholl, A., Puppis, G.: The many facets of string transducers (invited talk). In: Niedermeier, R., Paul, C. (eds.) Proceedings 36th International Symposium Theoretical Aspects of Computer Science. LIPIcs, vol. 126, pp. 2:1–2:21. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019). https://doi.org/10.4230/LIPIcs.STACS.2019.2

  16. Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  19. Wang, H.: On characters of semirings. Houston J. Math. 23(3), 391–405 (1997). https://www.math.uh.edu/~hjm/restricted/archive/v023n3/0391WANG.pdf

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Universität Leipzig, P.O. box 100 920, 04009, Leipzig, Germany

    Fan Feng & Andreas Maletti

Authors
  1. Fan Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Maletti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas Maletti .

Editor information

Editors and Affiliations

  1. Aristotle University of Thessaloniki, Thessaloniki, Greece

    Dimitrios Poulakis

  2. Aristotle University of Thessaloniki, Thessaloniki, Greece

    George Rahonis

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Feng, F., Maletti, A. (2022). Weighted Two-Way Transducers. In: Poulakis, D., Rahonis, G. (eds) Algebraic Informatics. CAI 2022. Lecture Notes in Computer Science, vol 13706. Springer, Cham. https://doi.org/10.1007/978-3-031-19685-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-19685-0_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-19684-3

  • Online ISBN: 978-3-031-19685-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation