Pages that link to "Item:Q3549290"
From MaRDI portal
The following pages link to Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290):
Displaying 9 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Fine hierarchies via Priestley duality (Q424549) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Boolean algebras of regular languages (Q2342107) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- The Boolean Algebra of Piecewise Testable Languages (Q3188268) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311150) (← links)
- New Computational Paradigms (Q5717071) (← links)