Pages that link to "Item:Q1817219"
From MaRDI portal
The following pages link to Logspace and logtime leaf languages (Q1817219):
Displaying 21 items.
- A characterization of the leaf language classes (Q287160) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Succinct circuit representations and leaf language classes are basically the same concept (Q671606) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Relating polynomial time to constant depth (Q1274992) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- LOGSPACE and PTIME characterized by programming languages (Q1575880) (← links)
- Machines that can output empty words (Q2272215) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
- On balanced versus unbalanced computation trees (Q4887490) (← links)
- (Q5092480) (← links)
- LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY (Q5248979) (← links)
- SELF-SPECIFYING MACHINES (Q5249003) (← links)
- Machines, Computations, and Universality (Q5710893) (← links)
- Dot operators (Q5958134) (← links)