On Stateless Multihead Finite Automata and Multihead Pushdown Automata
From MaRDI portal
Recommendations
- On stateless multihead automata: hierarchies and the emptiness problem
- On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
- States and heads do count for unary multi-head finite automata
- Stateless one-way multi-head finite automata with pebbles
- Head and state hierarchies for unary multi-head finite automata
Cites work
- k + 1 Heads Are Better than k
- Computing with membranes
- scientific article; zbMATH DE number 3690693 (Why is no real title available?)
- On Multi-Head Finite Automata
- ON STATELESS AUTOMATA AND P SYSTEMS
- On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
- On two-way multihead automata
- Variations on pushdown machines (Detailed Abstract)
Cited in
(16)- Two-head finite-state acceptors with translucent letters
- On computational power of partially blind automata
- Finite dP Automata versus Multi-head Finite Automata
- Automata with modulo counters and nondeterministic counter bounds
- A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA
- On stateless multicounter machines
- Some characterizations of multihead finite automata
- scientific article; zbMATH DE number 3980491 (Why is no real title available?)
- scientific article; zbMATH DE number 1361488 (Why is no real title available?)
- Head and state hierarchies for unary multi-head finite automata
- Stateless one-way multi-head finite automata with pebbles
- One-Way Multi-Head Finite Automata with Pebbles But No States
- Automata with modulo counters and nondeterministic counter bounds
- On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
- On stateless deterministic restarting automata
- On stateless multihead automata: hierarchies and the emptiness problem
This page was built for publication: On Stateless Multihead Finite Automata and Multihead Pushdown Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637229)
