ON STATELESS AUTOMATA AND P SYSTEMS

DOI10.1142/S0129054108006261zbMath1175.68180MaRDI QIDQ3542882

Linmin Yang, Oscar H. Ibarra, Zhe Dang

Publication date: 1 December 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

P system; reachability problem; stateless automaton; vector addition system

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

New Results on Vector and Homing Vector Automata, STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES, Unnamed Item, Hierarchies and Characterizations of Stateless Multicounter Machines, Head and state hierarchies for unary multi-head finite automata, On stateless multihead automata: hierarchies and the emptiness problem, On decision problems for parameterized machines, Automata with Modulo Counters and Nondeterministic Counter Bounds, Nanomachine Computing by Quorum Sensing, On Stateless Multicounter Machines, On Stateless Multihead Finite Automata and Multihead Pushdown Automata

Cites Work

• Unnamed Item
• A note on semilinear sets and bounded-reversal multihead pushdown automata
• Tissue P systems.
• Computing with membranes
• Catalytic P systems, semilinear sets, and vector addition systems
• Semigroups, Presburger formulas, and languages
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE