Pages that link to "Item:Q2465647"
From MaRDI portal
The following pages link to Prefix-free regular languages and pattern matching (Q2465647):
Displaying 5 items.
- Decidability of involution hypercodes (Q401315) (← links)
- A faster algorithm for finding shortest substring matches of a regular expression (Q1711433) (← links)
- Generalizations of Code Languages with Marginal Errors (Q3451108) (← links)
- AN IMPROVED PREFIX-FREE REGULAR-EXPRESSION MATCHING (Q5404517) (← links)
- Generalizations of Code Languages with Marginal Errors (Q6114833) (← links)
