P systems with symport/antiport simulating counter automata

DOI10.1007/s00236-004-0154-yzbMath1101.68030OpenAlexW2013622356MaRDI QIDQ707498

Hendrik Jan Hoogeboom, Pierluigi Frisco

Publication date: 9 February 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-004-0154-y

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Evolutionary Design of a Simple Membrane System ⋮ On sets of numbers accepted by P/T systems composed by join ⋮ Cell-like P systems with evolutional symport/antiport rules and membrane creation ⋮ A general approach for building combinationalPautomata ⋮ Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes ⋮ Rule synchronization for tissue P systems ⋮ Cell-like P systems with polarizations and minimal rules ⋮ MINIMAL COOPERATION IN SYMPORT/ANTIPORT TISSUE P SYSTEMS

Cites Work

• The power of communication: P systems with symport/antiport
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Unexpected universality results for three classes of P systems with symport/antiport
• Computing with membranes
• A guide to membrane computing.
• Machines, computations, and universality. 3rd international conference, MCU 2001, Chişinǎu, Moldova, May 23--27, 2001. Proceedings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item