A hierarchy theorem for multihead stack-counter automata

DOI10.1007/BF00262976zbMath0478.68081OpenAlexW2003216674MaRDI QIDQ1161306

Satoru Miyano

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00262976

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Hierarchies of one-way multihead automata languages, k\(+1\) heads are better than k for PDAs, Remarks on multihead pushdown automata and multihead stack automata