The following pages link to (Q5313794):
Displayed 16 items.
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- Decidability of involution hypercodes (Q401315) (← links)
- Efficient algorithms for computing the inner edit distance of a regular language via transducers (Q1712004) (← links)
- State complexity of prefix distance (Q2357110) (← links)
- Computing the edit distance of a regular language (Q2381500) (← links)
- Prefix Distance Between Regular Languages (Q2830223) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
- Edit-Distance Between Visibly Pushdown Languages (Q2971150) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q3451094) (← 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)
- State Complexity of Suffix Distance (Q5205049) (← links)
- DNA Coding Using the Subword Closure Operation (Q5452702) (← links)
- Quasi-Distances and Weighted Finite Automata (Q5500694) (← links)
- Closest substring problems for regular languages (Q5918147) (← links)