RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS

DOI10.1142/S0129054113500202zbMath1292.68065DBLPjournals/ijfcs/GheorghePPR13WikidataQ57518263 ScholiaQ57518263MaRDI QIDQ5404514

Mario J. Pérez-Jiménez, Gheorghe Păun, Marian Gheorghe, Grzegorz Rozenberg

Publication date: 24 March 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

finite automataformal languagesspiking neuronsmembrane computingnatural computingP systemcomplexity classescell membranesapplications of membrane computingsemantics and formal verificationsimulation frameworks

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (14)

Kernel P systems: from modelling to verification and testing ⋮ A bibliometric analysis of membrane computing (1998--2019) ⋮ Automatic design of arithmetic operation spiking neural P systems ⋮ A time-free uniform solution to subset sum problem by tissue P systems with cell division ⋮ Kernel P Systems Modelling, Testing and Verification - Sorting Case Study ⋮ The computational power of timed P systems with active membranes using promoters ⋮ Computational efficiency and universality of timed P systems with active membranes ⋮ Generating pictures in string representation with P systems: the case of space-filling curves ⋮ Time-free solution to SAT problem by tissue P systems ⋮ Computational efficiency and universality of timed P systems with membrane creation ⋮ An unsupervised learning algorithm for membrane computing ⋮ P Systems with Anti-Matter ⋮ Solution to PSPACE-complete problem using P systems with active membranes with time-freeness ⋮ P colonies. Survey

Cites Work

• A membrane algorithm with quantum-inspired subalgorithms and its application to image processing
• Spiking neural P systems with neuron division and budding
• Learning finite cover automata from queries
• Towards bridging two cell-inspired models: P systems and R systems
• An infinite hierarchy of languages defined by dP systems
• The computational power of membrane systems under tight uniformity conditions
• P systems and computational algebraic topology
• Trading polarizations for labels in P systems with active membranes
• Membrane computing and complexity theory: A characterization of PSPACE
• Discrete solutions to differential equations by metabolic P systems
• A rewriting logic framework for operational semantics of membrane systems
• Events and modules in reaction systems
• Spiking neural P systems with extended rules: universality and languages
• Simulating FAS-induced apoptosis by using P systems
• A uniform family of tissue P systems with cell division solving 3-COL in a linear time
• The metabolic algorithm for P systems: principles and applications
• Bounded sequence testing from deterministic finite state machines
• Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
• Reversing computation in membrane systems
• Computational complexity of tissue-like P systems
• Rule-based and object-based event structures for membrane systems
• Test generation from P systems using model checking
• Metabolic approximation of real periodical functions
• Introducing time in reaction systems
• Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
• The chemical abstract machine
• Array-rewriting P systems
• Complexity classes in models of cellular computing with membranes
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars
• Using enzymatic numerical P systems for modeling mobile robot controllers
• Scene segmentation by spike synchronization in reciprocally connected visual areas. II: Global assemblies and synchronization on larger space and time scales
• On uniformity within \(NC^ 1\)
• Finite state based testing of P systems
• A TOUR OF REACTION SYSTEMS
• PSYSTEMS WITH ACTIVE MEMBRANES WORKING IN POLYNOMIAL SPACE
• MODELING DIFFUSION IN A SIGNAL TRANSDUCTION PATHWAY: THE USE OF VIRTUAL VOLUMES IN P SYSTEMS
• LOG-GAIN STOICHIOMETRIC STEPWISE REGRESSION FOR MP SYSTEMS
• FORMAL VERIFICATION OF P SYSTEMS USING SPIN
• Membrane Dissolution and Division in P
• PP is as Hard as the Polynomial-Time Hierarchy
• MEMBRANE ALGORITHM WITH BROWNIAN SUBALGORITHM AND GENETIC SUBALGORITHM
• Computational efficiency of dissolution rules in membrane systems
• REGISTER MACHINE COMPUTATIONS ON BINARY NUMBERS BY OSCILLATING AND CATALYTIC CHEMICAL REACTIONS MODELLED USING MASS-ACTION KINETICS
• MODULAR ASSEMBLY OF CELL SYSTEMS BIOLOGY MODELS USINGPSYSTEMS
• Spatial and temporal pattern analysis via spiking neurons
• Probabilistic regularisation and symmetry in binocular dynamic programming stereo
• Contextual array P systems
• Deterministic and stochastic P systems for modelling cellular processes

This page was built for publication: RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS