Order- n correction for regular languages

DOI10.1145/360980.360995zbMath0276.68011WikidataQ56018898 ScholiaQ56018898MaRDI QIDQ4401552

Robert A. Wagner

Publication date: 1974

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/360980.360995

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68P20: Information storage and retrieval of data

68N01: General topics in the theory of software

Related Items

Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton, Data editing and imputation from a computational point of view, THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE, Bounded repairability of word languages, A novel look-ahead optimization strategy for trie-based approximate string matching, Approximate matching of regular expressions, Optimal algorithms for sensitivity analysis in associative multiplication problems, Automatic correction of syntax-errors in programming languages, Quantitative monitoring of STL with edit distance, Efficient algorithms for computing the inner edit distance of a regular language via transducers, How hard is computing the edit distance?, Computing the edit distance of a regular language, Breadth-first search strategies for trie-based syntactic pattern recognition, The per-character cost of repairing word languages, Computing the Expected Edit Distance from a String to a PFA, The Cost of Traveling between Languages, STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA