On multi-head automata with restricted nondeterminism

DOI10.1016/J.IPL.2012.04.009zbMath1243.68203OpenAlexW2010856808MaRDI QIDQ436607

Markus L. Schmid, Daniel Reidenbach

Publication date: 25 July 2012

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

Full work available at URL: https://dspace.lboro.ac.uk/2134/9847

zbMATH Keywords

formal languagesmulti-head automatarestricted nondeterminism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of multi-head finite automata: origins and directions
• Complementing deterministic tree-walking automata
• Halting space-bounded computations
• Amounts of nondeterminism in finite automata
• On tape-bounded complexity classes and multihead finite automata
• On non-determinacy in simple computing devices
• Complementing two-way finite automata
• Real-time computations with restricted nondeterminism
• On Multi-Head Finite Automata

This page was built for publication: On multi-head automata with restricted nondeterminism