One-way simple multihead finite automata
type: Item
instance of: scholarly article
title: One-way simple multihead finite automata
zbMATH Open document ID: 0408.68050
DOI: 10.1016/0304-3975(79)90033-1
author: K. Appert
published in: Theoretical Computer Science
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 3635505
zbMATH Keywords: One-Way Multihead Finite Automata
zbMATH Keywords: Tape-Bounded Turing Machines
MaRDI profile type: Publication
full work available at URL: 0304-3975(79)90033-1
OpenAlex ID: W1972068940
cites work: On Multi-Head Finite Automata
cites work: Multi-tape and multi-head pushdown automata
cites work: On 3-head versus 2-head finite automata
cites work: On tape-bounded complexity classes and multihead finite automata
cites work: One-way multihead writing finite automata
cites work: k + 1 Heads Are Better than k
cites work: A note on semilinear sets and bounded-reversal multihead pushdown automata
cites work: Finite automata with multiplication
cites work: A useful device for showing the solvability of some decision problems
cites work: Q4089754
cites work: Q5592246
cites work: Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
cites work: Counter machines and counter languages
cites work: Remarks on the complexity of nondeterministic counter languages
cites work: Erasable context-free languages
cites work: The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
description: scientific article; zbMATH DE number 3635505