The following pages link to (Q4936686):
Displaying 5 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
