Computing the edit distance of a regular language
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53946 (Why is no real title available?)
- scientific article; zbMATH DE number 1284415 (Why is no real title available?)
- scientific article; zbMATH DE number 1284433 (Why is no real title available?)
- scientific article; zbMATH DE number 1284437 (Why is no real title available?)
- scientific article; zbMATH DE number 1516705 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 2201366 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- Approximate matching of regular expressions
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- How hard is computing the edit distance?
- Order- n correction for regular languages
- Pattern Matching in Hypertext
Cited in
(36)- Quasi-distances and weighted finite automata
- Consensus string problem for multiple regular languages
- scientific article; zbMATH DE number 1962763 (Why is no real title available?)
- Approximate matching between a context-free grammar and a finite-state automaton
- Descriptional complexity of error detection
- Approximate membership for regular languages modulo the edit distance
- Bounded repairability of word languages
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- Calcul de la distance par les sous-mots
- The intractability of computing the Hamming distance
- Closest substring problems for regular languages
- Linear-space computation of the edit-distance between a string and a finite automaton
- State complexity of suffix distance
- Planning to chronicle
- scientific article; zbMATH DE number 2081043 (Why is no real title available?)
- Edit distance for pushdown automata
- The edit-distance between a regular language and a context-free language
- Top-down tree edit-distance of regular tree languages
- The cardinality of a sphere relative to an edit distance
- State complexity of neighbourhoods and approximate pattern matching
- Consensus string problem for multiple regular languages
- How hard is computing the edit distance?
- Quantitative monitoring of STL with edit distance
- Edit distance for pushdown automata
- State complexity of prefix distance
- State complexity of prefix distance
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
- The Cost of Traveling between Languages
- State complexity of neighbourhoods and approximate pattern matching
- Levenshtein graphs: resolvability, automorphisms \& determining sets
- How hard is to compute the edit distance
- Information, possible worlds and the cooptation of scepticism
- Efficient algorithms for computing the inner edit distance of a regular language via transducers
- Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!
- Computing the edit-distance between a regular language and a context-free language
- Prefix distance between regular languages
This page was built for publication: Computing the edit distance of a regular language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2381500)
