Pages that link to "Item:Q811118"

The following pages link to On the power of synchronization in parallel computations (Q811118):

Displaying 18 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)
• Some properties of space-bounded synchronized alternating Turing machines with universal states only (Q1184994) (← links)
• Communication for alternating machines (Q1203600) (← links)
• A note on realtime one-way synchronized alternating one-counter automata (Q1208731) (← links)
• Synchronized tree automata (Q1325832) (← links)
• Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← links)
• On communication-bounded synchronized alternating finite automata (Q1338889) (← links)
• On the synchronized derivation depth of context-free grammars (Q2271456) (← links)
• An infinite hierarchy induced by depth synchronization (Q2465043) (← links)
• On Models of a Nondeterministic Computation (Q3392968) (← links)
• WIRELESS MOBILE COMPUTING AND ITS LINKS TO DESCRIPTIVE COMPLEXITY (Q3526542) (← links)
• Complexity of E0L structural equivalence (Q4359286) (← links)
• The Communication Hierarchy of Time and Space Bounded Parallel Machines (Q4825478) (← links)
• Decidability of equivalence for deterministic synchronized tree automata (Q5096728) (← links)
• Complexity of EOL structural equivalence (Q5096917) (← links)