Hierarchies and Characterizations of Stateless Multicounter Machines

DOI10.1007/978-3-642-02882-3_41zbMath1248.68302OpenAlexW1595764749MaRDI 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

zbMATH Keywords

closure propertieshierarchysemilinear setreversal-boundednon-realtimestateless multihead automatastateless multicounter machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Automata with Modulo Counters and Nondeterministic Counter Bounds ⋮ Head and state hierarchies for unary multi-head finite automata ⋮ Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case ⋮ One-reversal counter machines and multihead automata: revisited ⋮ One-Reversal Counter Machines and Multihead Automata: Revisited ⋮ Unnamed Item

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

This page was built for publication: Hierarchies and Characterizations of Stateless Multicounter Machines