Pages that link to "Item:Q1334670"
From MaRDI portal
The following pages link to Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670):
Displaying 11 items.
- The generative capacity of block-synchronized context-free grammars (Q557813) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages (Q917319) (← links)
- A communication hierarchy of parallel computations (Q1129258) (← links)
- A note on realtime one-way synchronized alternating one-counter automata (Q1208731) (← links)
- Synchronized tree automata (Q1325832) (← links)
- A Space Lower Bound for Acceptance by One-Way Π<sub>2</sub>-Alternating Machines (Q2720409) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- Complexity of E0L structural equivalence (Q4359286) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q5096728) (← links)
- New results concerning synchronized finite automata (Q5204312) (← links)
