scientific article; zbMATH DE number 1870553

MaRDI QIDQ4793136zbMATH OpenFDO

Authors Gheorghe Păun, Takashi Yokomori, Y. Sakakibara

Publication date 18 February 2003

zbMATH Keywords

matrix grammarsP systemsmolecular computingrecursively enumerable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1860702
• P systems with local graph productions
• Computing with membranes (P systems): a variant
• scientific article; zbMATH DE number 1568811
• Membrane Computing

Cited in

(19)

• (Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode
• scientific article; zbMATH DE number 1951591 (Why is no real title available?)
• Breaking DES using P systems.
• A uniform family of tissue P systems with cell division solving 3-COL in a linear time
• A guide to membrane computing.
• A Formal Framework for Static (Tissue) P Systems
• Seeking computational efficiency boundaries: the Păun's conjecture
• Tissue P systems.
• P systems with local graph productions
• Extended spiking neural P systems with white hole rules and their red-green variants
• Generalized communicating P systems
• On the branching complexity of \(P\) systems
• P systems with shuffle operation and catalytic-like rules
• A linear-time tissue P system based solution for the 3-coloring problem
• A P-Lingua based simulator for tissue P systems
• On the power of membrane division in P systems
• Multiset-based tree model for membrane computing.
• Membrane Computing
• Graph theoretic and Boolean conditions for structurally fixed modes of augmented system forms

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 Q4793136)