Refined simulation of multihead automata

DOI10.1016/0020-0190(94)00152-9zbMath0938.68673OpenAlexW2001209994MaRDI QIDQ1339383

V. Pereyra

Publication date: 21 June 2000

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00152-9

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• k\(+1\) heads are better than k for PDAs
• Alternating multihead finite automata
• An effective simulation of deterministic pushdown automata with many two- way and one-way heads
• Transformational methods and their application to complexity problems. Corrigenda
• Alternating Pushdown and Stack Automata
• Fast Pattern Matching in Strings

This page was built for publication: Refined simulation of multihead automata