Pages that link to "Item:Q3613797"
From MaRDI portal
The following pages link to New Algorithms for Regular Expression Matching (Q3613797):
Displayed 9 items.
- String matching with variable length gaps (Q442239) (← links)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- A faster algorithm for finding shortest substring matches of a regular expression (Q1711433) (← links)
- From regular expression matching to parsing (Q2089747) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism (Q3000495) (← links)
- From Regular Expression Matching to Parsing (Q5092434) (← links)
- Space-Efficient Representations for Glushkov Automata (Q5384522) (← links)