Head and state hierarchies for unary multi-head finite automata
From MaRDI portal
Publication:478518
DOI10.1007/S00236-014-0206-XzbMATH Open1304.68110OpenAlexW2041114760MaRDI QIDQ478518FDOQ478518
Authors: Martin Kutrib, Andreas Malcher, Matthias Wendlandt 
Publication date: 3 December 2014
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-014-0206-x
Recommendations
- States and heads do count for unary multi-head finite automata
- On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
- On stateless multihead automata: hierarchies and the emptiness problem
- Size of unary one-way multi-head finite automata
- Simulations of unary one-way multi-head finite automata
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Multi-Head Finite Automata
- On stateless two-pushdown automata and restarting automata
- Complexity of multi-head finite automata: origins and directions
- A note on semilinear sets and bounded-reversal multihead pushdown automata
- Title not available (Why is that?)
- Hierarchies of one-way multihead automata languages
- ON STATELESS AUTOMATA AND P SYSTEMS
- On stateless multicounter machines
- On Stateless Multihead Finite Automata and Multihead Pushdown Automata
- k + 1 Heads Are Better than k
- Bounded-reversal multihead finite automata languages
- Hierarchies and Characterizations of Stateless Multicounter Machines
- One-way multihead finite automata and 2-bounded languages
- On stateless deterministic restarting automata
- On stateless multihead automata: hierarchies and the emptiness problem
Cited In (16)
- On the hierarchy classes of finite ultrametric automata
- A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA
- One-way reversible multi-head finite automata
- On Stateless Multihead Finite Automata and Multihead Pushdown Automata
- Tight hierarchy of data-independent multi-head automata
- States and heads do count for unary multi-head finite automata
- New results concerning synchronized finite automata
- On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
- Size of unary one-way multi-head finite automata
- Investigations on automata and languages over a unary alphabet
- Title not available (Why is that?)
- On stateless multihead automata: hierarchies and the emptiness problem
- Remarks on sorting and one-way multihead finite automata
- Hierarchies of one-way multihead automata languages
- Descriptional complexity of regular languages
- Simulations of unary one-way multi-head finite automata
This page was built for publication: Head and state hierarchies for unary multi-head finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q478518)
