FURTHER RESULTS ON TIME-FREE P SYSTEMS

DOI10.1142/S012905410600370XzbMath1088.68056MaRDI QIDQ3379514

Matteo Cavaliere, Vincenzo Deufemia

Publication date: 6 April 2006

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

zbMATH Keywords

universalitydecidabilitymembrane systemstime-free system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Undecidability and degrees of sets of sentences (03D35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (6)

Properties of Membrane Systems ⋮ Verification of membrane systems with delays via Petri nets with delays ⋮ Time-Free Spiking Neural P Systems ⋮ Membrane computing and brane calculi. Old, new, and future bridges ⋮ Asynchronous spiking neural P systems ⋮ Experiments on the reliability of stochastic spiking neural P systems

Cites Work

• Unnamed Item
• Unnamed Item
• Membrane systems with promoters/inhibitors
• Minimizing evolution communication P systems and automata
• Results on catalytic and evolution-communication P systems
• Computationally universal P systems without priorities: Two catalysts are sufficient

This page was built for publication: FURTHER RESULTS ON TIME-FREE P SYSTEMS