Three write heads are as good ask

DOI10.1007/BF01752387zbMath0437.68029OpenAlexW1990233737MaRDI QIDQ3878760

Franz-Josef Brandenburg

Publication date: 1981

Published in: Mathematical Systems Theory (Search for Journal in Brave)

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

zbMATH Keywords

multihead automatonnondeterministic one-way k-head writing finite automataread-only headsread-write head

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Representations of language families by homomorphic equality operations and generalized equality sets ⋮ Tradeoffs for language recognition on alternating machines ⋮ On the intersection of stacks and queues ⋮ Multiple equality sets and Post machines ⋮ STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES

Cites Work

• Reset machines
• Multiple equality sets and Post machines
• One-way multihead writing finite automata
• k + 1 Heads Are Better than k
• On Multi-Head Finite Automata
• Multi-tape and multi-head pushdown automata
• Real-Time Simulation of Multihead Tape Units

This page was built for publication: Three write heads are as good ask