Pages that link to "Item:Q672323"
From MaRDI portal
The following pages link to On the acceptance power of regular languages (Q672323):
Displayed 8 items.
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Machines that can output empty words (Q2272215) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)
- On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893) (← links)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)