Synchronized finite automata and 2DFA reductions

DOI10.1016/0304-3975(93)90119-EzbMath0797.68116OpenAlexW1982256214MaRDI QIDQ1261467

Oscar H. Ibarra, Nicholas Q. Tran

Publication date: 19 October 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90119-e

zbMATH Keywords

synchronizationreductionssynchronized pushdown automatatwo-way synchronized finite automata

Mathematics Subject Classification ID

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

Related Items (3)

On communication-bounded synchronized alternating finite automata ⋮ Decidability of equivalence for deterministic synchronized tree automata ⋮ Decidability of equivalence for deterministic synchronized tree automata

Cites Work

• On space-bounded synchronized alternating Turing machines
• k + 1 Heads Are Better than k
• Multi-tape and multi-head pushdown automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronized finite automata and 2DFA reductions