Three write heads are as good ask

DOI10.1007/BF01752387MaRDI QIDQ3878760zbMATH OpenOpenAlexFDO

Authors Franz J. 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)

Cites work

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

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3878760)