The following pages link to STACS 2005 (Q5710672):
Displaying 4 items.
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- Developments in Language Theory (Q5711979) (← links)