Hierarchies and Characterizations of Stateless Multicounter Machines
From MaRDI portal
Publication:5323089
DOI10.1007/978-3-642-02882-3_41zbMath1248.68302MaRDI QIDQ5323089
Ömer Eğecioğlu, Oscar H. Ibarra
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_41
closure properties; hierarchy; semilinear set; reversal-bounded; non-realtime; stateless multihead automata; stateless multicounter machine
68Q45: Formal languages and automata
Related Items
Unnamed Item, Head and state hierarchies for unary multi-head finite automata, One-reversal counter machines and multihead automata: revisited, Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case, Automata with Modulo Counters and Nondeterministic Counter Bounds, One-Reversal Counter Machines and Multihead Automata: Revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Computing with membranes
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
- ON STATELESS AUTOMATA AND P SYSTEMS
- On Stateless Multicounter Machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- On Stateless Multihead Automata: Hierarchies and the Emptiness Problem