scientific article; zbMATH DE number 1738655
From MaRDI portal
Publication:4529992
zbMATH Open0984.68070MaRDI QIDQ4529992FDOQ4529992
Authors: Carlos Martín-Vide, Gheorghe Păun 
Publication date: 7 May 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2055/20550082
Title of this publication is not available (Why is that?)
Recommendations
- Computing with membranes (P systems): a variant
- scientific article; zbMATH DE number 1860702
- Computational complexity of P systems with active membranes
- Membrane computing and complexity theory: A characterization of PSPACE
- On the computability power of membrane systems with controlled mobility
- Logical Approaches to Computational Barriers
- scientific article; zbMATH DE number 1407505
- A computational complexity theory in membrane computing
- Membrane Computing
- On the computational complexity of membrane systems
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)
Cited In (22)
- Computing with membranes (P systems): a variant
- Membrane division, restricted membrane creation and object complexity in P systems
- Title not available (Why is that?)
- Turing computability and membrane computing
- P systems with global rules
- On the universality of P systems with membrane creation
- P systems with symport/antiport simulating counter automata
- Membrane Computing
- Universality results for P systems based on brane calculi operations
- Some questions inspired by (membrane computing motivated) language-theoretic models
- On reversibility and determinism in P systems
- A look back at some early results in membrane computing
- Workshop on foundations of informatics. Proceedings of the workshop (FOI 2015), Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chisinau, Moldova, August 24--29, 2015
- Catalytic P systems, semilinear sets, and vector addition systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonterminal complexity of programmed grammars.
- On P systems with membrane creation
- Title not available (Why is that?)
- On strong reversibility in P systems and related problems
- Title not available (Why is that?)
- On the number of membranes in unary P systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529992)
