Skip to main content
Springer Nature Link
Log in

Two-Way Automata over Locally Finite Semirings

  • Conference paper
  • First Online:
Descriptional Complexity of Formal Systems (DCFS 2018)

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

Included in the following conference series:

Abstract

Two-way transducers or weighted automata are in general more powerful than one-way ones. We show that two-way automata over locally finite semirings may have undefined behaviour. We prove that it is decidable whether this behaviour is defined, and, if it is, we show that two-way automata over locally finite semirings are equivalent to one-way automata.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Birget, J.C.: Concatenation of inputs in a two-way automaton. Theor. Comput. Sci. 63(2), 141–156 (1989). https://doi.org/10.1016/0304-3975(89)90075-3

    Article  MathSciNet  MATH  Google Scholar 

  2. Carnino, V., Lombardy, S.: On determinism and unambiguity of weighted two-way automata. In: AFL 2014. EPTCS, vol. 151, pp. 188–200 (2014)

    Article  MathSciNet  Google Scholar 

  3. 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  MathSciNet  Google Scholar 

  4. Leung, H.: Limitedness theorem on finite automata with distance functions: an algebraic proof. Theor. Comput. Sci. 81(1, (Part A)), 137–145 (1991)

    Article  MathSciNet  Google Scholar 

  5. Lombardy, S.: Weighted two-way automata. In: NCMA 2015. books@ocg.at, vol. 318, pp. 37–47. Österreichische Computer Gesellschaft (2015)

    Google Scholar 

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

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

Download references

Author information

Authors and Affiliations

  1. LaBRI UMR 5800, Université de Bordeaux, INP Bordeaux, CNRS, Bordeaux, France

    Louis-Marie Dando & Sylvain Lombardy

Authors
  1. Louis-Marie Dando
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sylvain Lombardy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sylvain Lombardy .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, Saint Mary’s University, Halifax, Nova Scotia, Canada

    Stavros Konstantinidis

  2. Dipartimento di Informatica e Comunicazi, Universita degli Studi di Milano, Milan, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2018 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dando, LM., Lombardy, S. (2018). Two-Way Automata over Locally Finite Semirings. In: Konstantinidis, S., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2018. Lecture Notes in Computer Science(), vol 10952. Springer, Cham. https://doi.org/10.1007/978-3-319-94631-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94631-3_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94630-6

  • Online ISBN: 978-3-319-94631-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships