Computing the Maximum Bisimulation with Spiking Neural P Systems

DOI10.1007/978-3-642-20000-7_12zbMath1330.68069OpenAlexW197451749MaRDI QIDQ3009343

Alexandru I. Tomescu, Rodica Ceterchi

Publication date: 24 June 2011

Published in: Computation, Cooperation, and Life (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20000-7_12

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• CCS expressions, finite state processes, and three problems of equivalence
• A linear time solution to the single function coarsest partition problem
• An efficient algorithm for computing bisimulation equivalence
• ON SIMULATING A CLASS OF PARALLEL ARCHITECTURES
• Three Partition Refinement Algorithms
• Simulating the Bitonic Sort Using P Systems
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• An Incremental Bisimulation Algorithm
• Membrane Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item