Tissue P systems.

DOI10.1016/S0304-3975(02)00659-XzbMath1045.68063MaRDI QIDQ1401274

Carlos Martín-Vide, Gheorghe Păun, Alfonso Rodríguez-Patón, Juan Pazos

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-complete problems; P systems; Chomsky hierarchy; Membrane computing; Natural computing; Lindenmayer hierarchy

Mathematics Subject Classification ID

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

Related Items

A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM, Membrane Systems Using Noncooperative Rules with Unconditional Halting, First Steps Towards a Wet Implementation for τ-DPP, P Systems with String Objects and with Communication by Request, Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing, Integrated regulatory networks (IRNs): spatially organized biochemical modules, A linear time complexity of breadth-first search using P system with membrane division, A limitation of cell division in tissue P systems by PSPACE, Tissue P systems with cell separation: attacking the partition problem, On generalized communicating P systems with minimal interaction rules, P systems and computational algebraic topology, Membrane computing and complexity theory: A characterization of PSPACE, Multiset random context grammars, checkers, and transducers, A uniform family of tissue P systems with cell division solving 3-COL in a linear time, Computational complexity of tissue-like P systems, A quick introduction to membrane computing, Compositional semantics of spiking neural P systems, A P-Lingua based simulator for tissue P systems, A software tool for verification of spiking neural P systems, Designing a new software tool for digital imagery based on P systems, A uniform solution to the independent set problem through tissue P systems with cell separation, Tissue P systems with channel states, Using membrane computing for effective homology, Simulation of spatial P system models, Time-free solution to SAT problem using P systems with active membranes, A multiset-based model of synchronizing agents: Computability and robustness, Efficient simulation of tissue-like P systems by transition cell-like P systems, A polynomial alternative to unbounded environment for tissue P systems with cell division, A Linear–time Tissue P System Based Solution for the 3–coloring Problem, Spiking Neural P Systems with Astrocytes, An Adaptive Algorithm for P System Synchronization, Computing with Multi-membranes, Spiking Neural P Systems with Weights, CELL/SYMBOL COMPLEXITY OF TISSUE P SYSTEMS WITH SYMPORT/ANTIPORT RULES, TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS, ON STATELESS AUTOMATA AND P SYSTEMS, MODULAR ASSEMBLY OF CELL SYSTEMS BIOLOGY MODELS USINGPSYSTEMS, (Tissue) P systems with cell polarity

Cites Work

• A note on isomorphic simulation of automata by networks of two-state automata
• Automata networks. Fourteenth LITP spring school on theoretical computer science, Argelès-Village, France, May 12-16, 1986. Proceedings
• Petri net algorithms in the theory of matrix grammars
• Computing with membranes
• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• A logical calculus of the ideas immanent in nervous activity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item