Pages that link to "Item:Q394744"
From MaRDI portal
The following pages link to Bounded repairability of word languages (Q394744):
Displaying 10 items.
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- The per-character cost of repairing word languages (Q2453121) (← links)
- Prefix Distance Between Regular Languages (Q2830223) (← links)
- The Cost of Traveling between Languages (Q3012923) (← links)
- Restorations of punctured languages and similarity of languages (Q3376537) (← links)
- Edit Distance for Pushdown Automata (Q3449470) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- Quasi-Distances and Weighted Finite Automata (Q5500694) (← links)
- Absent Subsequences in Words (Q6070611) (← links)