Bounded repairability of word languages

DOI10.1016/J.JCSS.2013.06.001MaRDI QIDQ394744zbMATH OpenOpenAlexFDO

Authors Michael Benedikt, Gabriele Puppis, Cristian Riveros

Publication date 27 January 2014

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2013.06.001

zbMATH Keywords

edit distancebounded repairregular languages

Mathematics Subject Classification ID

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

Recommendations

• Bounded repairability for regular tree languages
• The per-character cost of repairing word languages
• Which XML schemas are streaming bounded repairable?
• How to travel between languages
• Program repair without regret

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1048047 (Why is no real title available?)
• Answer sets for consistent query answering in inconsistent databases
• Automata, logics, and infinite games. A guide to current research
• Computing the edit distance of a regular language
• Distances between languages and reflexivity of relations
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• Energy parity games
• Foundations of Information and Knowledge Systems
• Improved limitedness theorems on finite automata with distance functions
• Order- n correction for regular languages
• Sur une variante des fonctions séquentielles
• The limitedness problem on distance automata: Hashiguchi's method revisited

Cited in

(12)

• Which XML schemas are streaming bounded repairable?
• Quasi-distances and weighted finite automata
• Weak inverse neighborhoods of languages
• The Cost of Traveling between Languages
• State complexity of neighbourhoods and approximate pattern matching
• Restorations of punctured languages and similarity of languages
• Bounded repairability for regular tree languages
• Descriptional complexity of error detection
• Edit distance for pushdown automata
• Prefix distance between regular languages
• How to travel between languages
• Absent Subsequences in Words

This page was built for publication: Bounded repairability of word languages

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