Pages that link to "Item:Q1712004"
From MaRDI portal
The following pages link to Efficient algorithms for computing the inner edit distance of a regular language via transducers (Q1712004):
Displayed 5 items.
- State Complexity of Prefix Distance (Q2947426) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q3451118) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- State Complexity of Suffix Distance (Q5205049) (← links)
- Finite Approximations and Similarity of Languages (Q6169950) (← links)