Pages that link to "Item:Q1854409"
From MaRDI portal
The following pages link to How hard is computing the edit distance? (Q1854409):
Displaying 19 items.
- The intractability of computing the Hamming distance (Q557834) (← links)
- A simple attack on some clock-controlled generators (Q980102) (← links)
- Efficient algorithms for computing the inner edit distance of a regular language via transducers (Q1712004) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Computing the edit distance of a regular language (Q2381500) (← links)
- Prefix Distance Between Regular Languages (Q2830223) (← links)
- STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA (Q3401489) (← links)
- String distances and intrusion detection: Bridging the gap between formal languages and computer security (Q3431441) (← links)
- Edit Distance for Pushdown Automata (Q3449470) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q3451118) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE (Q5495420) (← links)
- Quasi-Distances and Weighted Finite Automata (Q5500694) (← links)
- Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)
- Input-driven pushdown automata for edit distance neighborhood (Q5918675) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920061) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
