Pages that link to "Item:Q2390207"

The following pages link to A PTIME-complete matching problem for SLP-compressed words (Q2390207):

Displaying 5 items.

• Leaf languages and string compression (Q550251) (← links)
• Complexity of equations over sets of natural numbers (Q633764) (← links)
• The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
• The complexity of compressed membership problems for finite automata (Q2254509) (← links)
• COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA (Q3056281) (← links)