Bounded repairability of word languages

DOI10.1016/J.JCSS.2013.06.001zbMATH Open1410.68196OpenAlexW2108890998MaRDI QIDQ394744FDOQ394744

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

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

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)

Cites Work

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

Cited In (12)

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

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)