Order- n correction for regular languages

DOI10.1145/360980.360995MaRDI QIDQ4401552zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Formal languages and automata (68Q45)

Cited in

(18)

• Bounded repairability of word languages
• The Cost of Traveling between Languages
• State complexity of additive weighted finite automata
• Approximate matching of regular expressions
• How hard is computing the edit distance?
• The edit-distance between a regular language and a context-free language
• 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
• Efficient algorithms for computing the inner edit distance of a regular language via transducers
• Optimal algorithms for sensitivity analysis in associative multiplication problems
• Breadth-first search strategies for trie-based syntactic pattern recognition
• The per-character cost of repairing word languages
• Computing the edit distance of a regular language
• Data editing and imputation from a computational point of view
• A novel look-ahead optimization strategy for trie-based approximate string matching
• Quantitative monitoring of STL with edit distance
• Automatic correction of syntax-errors in programming languages
• Absent Subsequences in Words

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)