P systems with symport/antiport simulating counter automata

DOI10.1007/S00236-004-0154-YMaRDI QIDQ707498zbMATH OpenOpenAlexFDO

Authors Pierluigi Frisco, Hendrik Jan Hoogeboom

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

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

Recommendations

• scientific article; zbMATH DE number 1951589
• About \(P\) systems with symport/antiport
• scientific article; zbMATH DE number 2182442
• Generating languages by P systems with minimal symport/antiport
• Membrane Computing

Cites work

• scientific article; zbMATH DE number 5604070 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1735631 (Why is no real title available?)
• scientific article; zbMATH DE number 1948493 (Why is no real title available?)
• scientific article; zbMATH DE number 1951584 (Why is no real title available?)
• scientific article; zbMATH DE number 1951587 (Why is no real title available?)
• scientific article; zbMATH DE number 1951588 (Why is no real title available?)
• scientific article; zbMATH DE number 1951589 (Why is no real title available?)
• scientific article; zbMATH DE number 1951598 (Why is no real title available?)
• scientific article; zbMATH DE number 1738655 (Why is no real title available?)
• scientific article; zbMATH DE number 1738664 (Why is no real title available?)
• A guide to membrane computing.
• Computing with membranes
• Machines, computations, and universality. 3rd international conference, MCU 2001, Chişinǎu, Moldova, May 23--27, 2001. Proceedings
• On the power of P systems with symport rules
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The power of communication: P systems with symport/antiport
• Unexpected universality results for three classes of P systems with symport/antiport

Cited in

(14)

• scientific article; zbMATH DE number 1951581 (Why is no real title available?)
• scientific article; zbMATH DE number 1948493 (Why is no real title available?)
• A general approach for building combinationalPautomata
• Generating languages by P systems with minimal symport/antiport
• Simulating numerical programs by symport/antiport P-systems
• scientific article; zbMATH DE number 1951589 (Why is no real title available?)
• Rule synchronization for tissue P systems
• On sets of numbers accepted by P/T systems composed by join
• Cell-like P systems with evolutional symport/antiport rules and membrane creation
• MINIMAL COOPERATION IN SYMPORT/ANTIPORT TISSUE P SYSTEMS
• Cell-like P systems with polarizations and minimal rules
• Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes
• A P-Lingua based simulator for P systems with symport/antiport rules
• Evolutionary design of a simple membrane system

This page was built for publication: P systems with symport/antiport simulating counter automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707498)