Pages that link to "Item:Q4401552"
From MaRDI portal
The following pages link to Order- <i>n</i> correction for regular languages (Q4401552):
Displaying 18 items.
- Bounded repairability of word languages (Q394744) (← links)
- A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727) (← links)
- Approximate matching of regular expressions (Q1119025) (← links)
- Optimal algorithms for sensitivity analysis in associative multiplication problems (Q1149785) (← links)
- Automatic correction of syntax-errors in programming languages (Q1211841) (← links)
- Quantitative monitoring of STL with edit distance (Q1667648) (← links)
- Efficient algorithms for computing the inner edit distance of a regular language via transducers (Q1712004) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- Computing the edit distance of a regular language (Q2381500) (← links)
- Breadth-first search strategies for trie-based syntactic pattern recognition (Q2383946) (← links)
- The per-character cost of repairing word languages (Q2453121) (← links)
- Computing the Expected Edit Distance from a String to a PFA (Q2830206) (← links)
- The Cost of Traveling between Languages (Q3012923) (← links)
- STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA (Q3401489) (← links)
- Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton (Q4605516) (← links)
- Data editing and imputation from a computational point of view (Q4850123) (← links)
- THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE (Q5495420) (← links)
- Absent Subsequences in Words (Q6070611) (← links)