The following pages link to (Q3975141):
Displaying 10 items.
- One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages (Q917319) (← links)
- On space-bounded synchronized alternating Turing machines (Q1193901) (← links)
- A note on realtime one-way synchronized alternating one-counter automata (Q1208731) (← links)
- Synchronized finite automata and 2DFA reductions (Q1261467) (← links)
- Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← links)
- On communication-bounded synchronized alternating finite automata (Q1338889) (← links)
- Complexity of E0L structural equivalence (Q4359286) (← links)
- Complexity of EOL structural equivalence (Q5096917) (← links)
- New results concerning synchronized finite automata (Q5204312) (← links)
- Parallel machine models: how they are and where are they going (Q6573922) (← links)
