Pages that link to "Item:Q4640043"
From MaRDI portal
The following pages link to State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043):
Displaying 5 items.
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages (Q5041248) (← links)
- State Complexity of Suffix Distance (Q5205049) (← links)
- Closest substring problems for regular languages (Q5918147) (← links)
- Input-driven pushdown automata for edit distance neighborhood (Q5918675) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)