Pages that link to "Item:Q2254509"
From MaRDI portal
The following pages link to The complexity of compressed membership problems for finite automata (Q2254509):
Displaying 11 items.
- One-variable word equations in linear time (Q261339) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- Compressed membership for NFA (DFA) with compressed labels is in NP (P) (Q2904756) (← links)
- (Q4544428) (← links)
- Computer Science Logic (Q5292652) (← links)
- Automata, Languages and Programming (Q5466524) (← links)
- Word Problems and Membership Problems on Compressed Words (Q5470731) (← links)
- The fully compressed subgroup membership problem (Q6038521) (← links)
- Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\) (Q6614621) (← links)