Pages that link to "Item:Q1068537"
From MaRDI portal
The following pages link to On the power of alternation in automata theory (Q1068537):
Displaying 16 items.
- Separation of deterministic, nondeterministic and alternating complexity classes (Q809596) (← links)
- A note on real-time one-way alternating multicounter machines (Q809610) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- A grammatical characterization of alternating pushdown automata (Q1123637) (← links)
- Lower bounds for language recognition on two-dimensional alternating multihead machines (Q1124335) (← links)
- On space-bounded synchronized alternating Turing machines (Q1193901) (← links)
- A characterization of exponential-time languages by alternating context- free grammars (Q1193905) (← links)
- Communication for alternating machines (Q1203600) (← links)
- Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← links)
- On the power of alternation on reversal-bounded alternating Turing machines with a restriction (Q1390864) (← links)
- A leaf-time hierarchy of two-dimensional alternating turing machines (Q1822969) (← links)
- Constructions for alternating finite automata<sup>∗</sup> (Q3477972) (← links)
- (Q3687716) (← links)
- (Q4016418) (← links)
- Gaining Power by Input Operations: Finite Automata and Beyond (Q5200048) (← links)
- Converting finite width AFAs to nondeterministic and universal finite automata (Q6131195) (← links)