Pages that link to "Item:Q4887490"
From MaRDI portal
The following pages link to On balanced versus unbalanced computation trees (Q4887490):
Displaying 12 items.
- A characterization of the leaf language classes (Q287160) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
- Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria (Q5055938) (← links)
- (Q5092480) (← links)
- LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY (Q5248979) (← links)
- SELF-SPECIFYING MACHINES (Q5249003) (← links)
- Dot operators (Q5958134) (← links)
