Improved limitedness theorems on finite automata with distance functions
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Order-n correction for regular languages
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Distances between languages and reflexivity of relations
Theoretical Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The limitedness problem on distance automata: Hashiguchi's method revisited
Theoretical Computer Science
Computing the edit distance of a regular language
Information and Computation
COMA: a system for flexible combination of schema matching approaches
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Repair checking in inconsistent databases: algorithms and complexity
Proceedings of the 12th International Conference on Database Theory
Regular Repair of Specifications
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Theoretical Computer Science
| Hi-index | 0.00 |
What do you do if a computational object (e.g. program trace) fails a specification? An obvious approach is to perform a repair: modify the object minimally to get something that satisfies the constraints. This approach has been investigated in the database community, for integrity constraints, and in the AI community for propositional logics. Here we study how difficult it is to repair a document in the form of a string. Specifically, we consider number of edits that must be applied to an input string in order to satisfy a given target language. This number may be unbounded; our main contribution is to isolate the complexity of the bounded repair problem based on a characterization of the regular languages that admit bounded repairr. We consider the settings where the repair strategy is unconstrained and when the editing must be produced in a streaming way, i.e. by a letter-to-letter transducer.