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 15 items.
- The generative capacity of block-synchronized context-free grammars (Q557813) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- On the power of synchronization in parallel computations (Q811118) (← 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)
- Some properties of space-bounded synchronized alternating Turing machines with universal states only (Q1184994) (← 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 \(\Pi_2\)-alternating machines (Q2720409) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- (Q3782784) (← links)
- On the power of synchronization in parallel computations (Q3975141) (← 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)
