Pages that link to "Item:Q5710893"
From MaRDI portal
The following pages link to Machines, Computations, and Universality (Q5710893):
Displaying 9 items.
- A characterization of the leaf language classes (Q287160) (← links)
- Succinct circuit representations and leaf language classes are basically the same concept (Q671606) (← links)
- Autoreducibility, mitoticity, and immunity (Q881593) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Machines that can output empty words (Q2272215) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- Generic separations and leaf languages (Q4419264) (← links)