One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages

DOI10.1016/0020-0190(90)90099-JzbMath0704.68068OpenAlexW1979188657MaRDI QIDQ917319

Anna Slobodová

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90099-j

zbMATH Keywords

computational complexitysynchronized alternation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (3)

Deterministic versus nondeterministic space in terms of synchronized alternating machines ⋮ Communication for alternating machines ⋮ A note on realtime one-way synchronized alternating one-counter automata

Cites Work

• On the power of synchronization in parallel computations
• Deterministic versus nondeterministic space in terms of synchronized alternating machines
• Alternation
• Unnamed Item
• Unnamed Item

This page was built for publication: One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages