Pages that link to "Item:Q859980"
From MaRDI portal
The following pages link to Languages polylog-time reducible to dot-depth 1/2 (Q859980):
Displaying 10 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← 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)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- (Q4501562) (← links)
- (Q4699310) (← links)
- STACS 2005 (Q5710672) (← links)
- Developments in Language Theory (Q5711979) (← links)