Order- n correction for regular languages
From MaRDI portal
Publication:4401552
DOI10.1145/360980.360995zbMATH Open0276.68011DBLPjournals/cacm/Wagner74OpenAlexW1979649888WikidataQ56018898 ScholiaQ56018898MaRDI QIDQ4401552FDOQ4401552
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
General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Formal languages and automata (68Q45)
Cited In (18)
- Approximate matching of regular expressions
- THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE
- Bounded repairability of word languages
- The per-character cost of repairing word languages
- A novel look-ahead optimization strategy for trie-based approximate string matching
- Optimal algorithms for sensitivity analysis in associative multiplication problems
- Data editing and imputation from a computational point of view
- Absent Subsequences in Words
- 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
- Quantitative monitoring of STL with edit distance
- Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton
- Computing the Expected Edit Distance from a String to a PFA
- The Cost of Traveling between Languages
- STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA
- Automatic correction of syntax-errors in programming languages
- Efficient algorithms for computing the inner edit distance of a regular language via transducers
This page was built for publication: Order- n correction for regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401552)
