The following pages link to (Q2762531):
Displaying 12 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Fine hierarchies via Priestley duality (Q424549) (← links)
- Definability in the structure of words with the inclusion relation (Q606049) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- A conjecture on the concatenation product (Q3147025) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- Regular languages of star height one (Q3339308) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
- APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES (Q5462124) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)