scientific article; zbMATH DE number 1735636
From MaRDI portal
Publication:4329021
zbMath1005.68106MaRDI QIDQ4329021
Publication date: 30 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (12)
Multiset random context grammars, checkers, and transducers ⋮ Three ``quantum algorithms to solve 3-SAT ⋮ Computational efficiency and universality of timed P systems with active membranes ⋮ P systems with active membranes: Trading time for space ⋮ Results on catalytic and evolution-communication P systems ⋮ Computationally universal P systems without priorities: Two catalysts are sufficient ⋮ Computing with energy and chemical reactions ⋮ (UREM) P Systems with a Quantum-Like Behavior: Background, Definition, and Computational Power ⋮ Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes ⋮ Improved descriptional complexity results on generalized forbidding grammars ⋮ Cell-like P systems with polarizations and minimal rules ⋮ \(P\) systems with active membranes and without polarizations
This page was built for publication: