Pages that link to "Item:Q3073643"
From MaRDI portal
The following pages link to A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (Q3073643):
Displaying 9 items.
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- Finding shuffle words that represent optimal scheduling of shared memory access (Q2855755) (← links)
- Automata with Modulo Counters and Nondeterministic Counter Bounds (Q2914726) (← links)
- (Q5416362) (← links)