Pages that link to "Item:Q673469"
From MaRDI portal
The following pages link to Approximately matching context-free languages (Q673469):
Displaying 10 items.
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- Exact and approximate matching of matrix languages (Q4549936) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- Approximate matching of XML document with regular hedge grammar (Q5699916) (← links)
- Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)
