Skip to main content
Springer Nature Link
Log in

The Cost of Traveling between Languages

  • Conference paper
Automata, Languages and Programming (ICALP 2011)

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

Included in the following conference series:

Abstract

We show how to calculate the maximum number of edits per character needed to convert any string in one regular language to a string in another language. Our algorithm makes use of a local determinization procedure applicable to a subclass of distance automata. We then show how to calculate the same property when the editing needs to be done in streaming fashion, by a finite state transducer, using a reduction to mean-payoff games. We show that the optimal streaming editor can be produced in PTIME.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Benedikt, M., Puppis, G., Riveros, C.: Regular repair of specifications. In: LICS (2011)

    Google Scholar 

  2. Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. J. of Game Theory 8, 109–113 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  3. Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: STOC, pp. 302–311 (1984)

    Google Scholar 

  4. Konstantinidis, S.: Computing the edit distance of a regular language. Inf. and Comp. 205(9), 1307–1316 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  5. Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 101–112. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  6. Matouek, J., Gärtner, B.: Understanding and Using Linear Programming (2006)

    Google Scholar 

  7. Mohri, M.: Finite-state transducers in language and speech processing. J. of Comp. Ling. 23(2), 269–311 (1997)

    MathSciNet  Google Scholar 

  8. Mohri, M.: Edit-distance of weighted automata: general definitions and algorithms. J. of Found. of Comp. Sc. 14(6), 957–982 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Simon, I.: Recognizable sets with multiplicities in the tropical semiring. In: Koubek, V., Janiga, L., Chytil, M.P. (eds.) MFCS 1988. LNCS, vol. 324, pp. 107–120. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  10. Wagner, R.A.: Order-n correction for regular languages. CACM 17(5), 265–268 (1974)

    Article  MATH  Google Scholar 

  11. Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. JACM 21(1), 168–173 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  12. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158, 343–359 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Oxford University, Parks Road, Oxford, OX13QD, UK

    Michael Benedikt, Gabriele Puppis & Cristian Riveros

Authors
  1. Michael Benedikt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriele Puppis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cristian Riveros
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101, Reykjavik, Iceland

    Luca Aceto

  2. Fakultät für Informatik, Universität Wien, Universitätsstraße10/9, 1090, Wien, Österreich, Austria

    Monika Henzinger

  3. Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00, Praha 1, Czech Republic

    Jiří Sgall

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benedikt, M., Puppis, G., Riveros, C. (2011). The Cost of Traveling between Languages. In: Aceto, L., Henzinger, M., Sgall, J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22012-8_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22011-1

  • Online ISBN: 978-3-642-22012-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics