Pages that link to "Item:Q2254509"

The following pages link to The complexity of compressed membership problems for finite automata (Q2254509):

Displaying 5 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)
• The fully compressed subgroup membership problem (Q6038521) (← links)
• Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\) (Q6614621) (← links)