The Cost of Traveling between Languages
From MaRDI portal
Publication:3012923
DOI10.1007/978-3-642-22012-8_18zbMath1333.68304OpenAlexW1900845398MaRDI QIDQ3012923
Cristian Riveros, Gabriele Puppis, Michael Benedikt
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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms on strings (68W32)
Related Items (7)
Which XML schemas are streaming bounded repairable? ⋮ Approximate membership for regular languages modulo the edit distance ⋮ Finite Approximations and Similarity of Languages ⋮ Unnamed Item ⋮ Efficient algorithms for computing the inner edit distance of a regular language via transducers ⋮ A note on the approximation of mean-payoff games ⋮ Non-deterministic Weighted Automata on Random Words
Cites Work
- Bounded repairability of word languages
- A new polynomial-time algorithm for linear programming
- Positional strategies for mean payoff games
- The complexity of mean payoff games on graphs
- Computing the edit distance of a regular language
- Order- n correction for regular languages
- The String-to-String Correction Problem
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- Unnamed Item
This page was built for publication: The Cost of Traveling between Languages
