Head and state hierarchies for unary multi-head finite automata
type: Item
instance of: scholarly article
title: Head and state hierarchies for unary multi-head finite automata
zbMATH Open document ID: 1304.68110
author: Martin Kutrib
author: Andreas Malcher
author: Matthias Wendlandt
published in: Acta Informatica
publication date: 2014-12-03T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6376646
zbMATH Keywords: deterministic one-way multi-head finite automata
zbMATH Keywords: state hierarchy
zbMATH Keywords: emptiness problem
zbMATH Keywords: stateless automata
MaRDI profile type: Publication
full work available at URL: s00236-014-0206-x
OpenAlex ID: W2041114760
cites work: Hierarchies of one-way multihead automata languages
cites work: On Stateless Multicounter Machines
cites work: On Stateless Multihead Finite Automata and Multihead Pushdown Automata
cites work: Q4198075
cites work: Complexity of multi-head finite automata: origins and directions
cites work: Q3862379
cites work: A note on semilinear sets and bounded-reversal multihead pushdown automata
cites work: Hierarchies and Characterizations of Stateless Multicounter Machines
cites work: On stateless multihead automata: hierarchies and the emptiness problem
cites work: On stateless deterministic restarting automata
cites work: ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
cites work: One-way multihead finite automata and 2-bounded languages
cites work: Q4991691
cites work: On Multi-Head Finite Automata
cites work: Bounded-reversal multihead finite automata languages
cites work: ON STATELESS AUTOMATA AND P SYSTEMS
cites work: k + 1 Heads Are Better than k
DOI: 10.1007/S00236-014-0206-X
description: scientific article; zbMATH DE number 6376646