The following pages link to (Q4382097):
Displaying 9 items.
- Optimizing the region algebra is PSPACE-complete (Q765502) (← links)
- Finite-automaton aperiodicity is PSPACE-complete (Q809608) (← links)
- Extended regular expressions of star degree at most two (Q921911) (← links)
- Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy (Q1647695) (← links)
- Deciding FO-definability of regular languages (Q2695357) (← links)
- Regular expression star-freeness is PSPACE-complete (Q2763598) (← links)
- The intersection problem for finite monoids (Q3304129) (← links)
- Aperiodicity in Tree Automata (Q3522867) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)