Order- n correction for regular languages
From MaRDI portal
Publication:4401552
DOI10.1145/360980.360995zbMath0276.68011OpenAlexW1979649888WikidataQ56018898 ScholiaQ56018898MaRDI QIDQ4401552
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
Formal languages and automata (68Q45) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)
Related Items (18)
Computing the edit distance of a regular language ⋮ Breadth-first search strategies for trie-based syntactic pattern recognition ⋮ A novel look-ahead optimization strategy for trie-based approximate string matching ⋮ Approximate matching of regular expressions ⋮ Quantitative monitoring of STL with edit distance ⋮ Bounded repairability of word languages ⋮ Data editing and imputation from a computational point of view ⋮ Absent Subsequences in Words ⋮ Optimal algorithms for sensitivity analysis in associative multiplication problems ⋮ Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton ⋮ Efficient algorithms for computing the inner edit distance of a regular language via transducers ⋮ The per-character cost of repairing word languages ⋮ The Cost of Traveling between Languages ⋮ Automatic correction of syntax-errors in programming languages ⋮ Computing the Expected Edit Distance from a String to a PFA ⋮ STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA ⋮ THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE ⋮ How hard is computing the edit distance?
This page was built for publication: Order- n correction for regular languages
