Bounded repairability of word languages

DOI10.1016/j.jcss.2013.06.001zbMath1410.68196OpenAlexW2108890998MaRDI QIDQ394744

Gabriele Puppis, Cristian Riveros, Michael Benedikt

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

regular languagesedit distancebounded repair

Mathematics Subject Classification ID

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

Related Items (9)

Which XML schemas are streaming bounded repairable? ⋮ Edit Distance for Pushdown Automata ⋮ Weak inverse neighborhoods of languages ⋮ Absent Subsequences in Words ⋮ State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ The Cost of Traveling between Languages ⋮ Descriptional Complexity of Error Detection ⋮ Quasi-Distances and Weighted Finite Automata ⋮ Prefix Distance Between Regular Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved limitedness theorems on finite automata with distance functions
• Sur une variante des fonctions séquentielles
• Distances between languages and reflexivity of relations
• Energy parity games
• Automata, logics, and infinite games. A guide to current research
• The limitedness problem on distance automata: Hashiguchi's method revisited
• Computing the edit distance of a regular language
• Order- n correction for regular languages
• Answer sets for consistent query answering in inconsistent databases
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• Foundations of Information and Knowledge Systems

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