Pages that link to "Item:Q5495420"
From MaRDI portal
The following pages link to THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE (Q5495420):
Displayed 12 items.
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- Decidability of involution hypercodes (Q401315) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Prefix Distance Between Regular Languages (Q2830223) (← links)
- Edit-Distance Between Visibly Pushdown Languages (Q2971150) (← 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)
- 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)
