Pages that link to "Item:Q2381500"
From MaRDI portal
The following pages link to Computing the edit distance of a regular language (Q2381500):
Displaying 29 items.
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- Approximate membership for regular languages modulo the edit distance (Q387000) (← links)
- Bounded repairability of word languages (Q394744) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Information, possible worlds and the cooptation of scepticism (Q625697) (← 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)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- State complexity of prefix distance (Q2357110) (← links)
- The per-character cost of repairing word languages (Q2453121) (← links)
- Levenshtein graphs: resolvability, automorphisms \& determining sets (Q2689484) (← links)
- Prefix Distance Between Regular Languages (Q2830223) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
- The Cost of Traveling between Languages (Q3012923) (← links)
- Planning to Chronicle (Q3381972) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q3451118) (← links)
- Calcul de la distance par les sous-mots (Q3780455) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages (Q5041248) (← links)
- How hard is to compute the edit distance (Q5055912) (← links)
- Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard! (Q5111349) (← links)
- State Complexity of Suffix Distance (Q5205049) (← links)
- THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE (Q5495420) (← links)
- Quasi-Distances and Weighted Finite Automata (Q5500694) (← links)
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS (Q5696947) (← links)
- Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)
- Closest substring problems for regular languages (Q5918147) (← links)
