The Cost of Traveling between Languages

DOI10.1007/978-3-642-22012-8_18MaRDI QIDQ3012923zbMATH OpenOpenAlexFDO

Authors Michael Benedikt, Gabriele Puppis, Cristian Riveros

Publication date 7 July 2011

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22012-8_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• How to travel between languages
• The cost of address translation
• Language barriers
• Cost heterogeneity and the persistence of bilingualism
• scientific article; zbMATH DE number 3845857
• The measurement of the value of a language
• The chop of languages

Cites work

• A new polynomial-time algorithm for linear programming
• Bounded repairability of word languages
• Computing the edit distance of a regular language
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• scientific article; zbMATH DE number 4072419 (Why is no real title available?)
• Order- n correction for regular languages
• Positional strategies for mean payoff games
• The complexity of mean payoff games on graphs
• The String-to-String Correction Problem

Cited in

(9)

• Efficient algorithms for computing the inner edit distance of a regular language via transducers
• A note on the approximation of mean-payoff games
• The per-character cost of repairing word languages
• Which XML schemas are streaming bounded repairable?
• Approximate membership for regular languages modulo the edit distance
• How to travel between languages
• Non-deterministic Weighted Automata on Random Words
• Approximate learning of limit-average automata
• Finite Approximations and Similarity of Languages

This page was built for publication: The Cost of Traveling between Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012923)