On the branching complexity of P systems

MaRDI QIDQ3409975zbMATH OpenFDO

Authors Gabriel Ciobanu, Gheorghe Păun, Mario J. Pérez-Jiménez

Publication date 21 November 2006

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Decidability of theories and sets of sentences (03B25) Descriptive complexity and finite models (68Q19)

Recommendations

• Membrane Computing
• On determinism versus nondeterminism in P systems
• On the computational complexity of membrane systems
• scientific article; zbMATH DE number 1870553
• Computing and Combinatorics

Cited in

(7)

• Analysis on the minimal representation of \(\mathrm O(p,q)\). II: Branching laws.
• Membrane Computing
• Membrane Computing
• On the degree of parallelism in membrane systems
• Some complexity results on transition systems and elementary net systems
• Type inference for hierarchical multiset structures in rule-based systems
• scientific article; zbMATH DE number 7650825 (Why is no real title available?)

This page was built for publication: On the branching complexity of \(P\) systems

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