Membrane Computing
From MaRDI portal
Publication:5316633
DOI10.1007/B106721zbMATH Open1117.68361OpenAlexW2760751007MaRDI QIDQ5316633FDOQ5316633
Publication date: 14 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106721
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (17)
- Membrane computing and brane calculi. Old, new, and future bridges
- A bibliometric analysis of membrane computing (1998--2019)
- (Mem)brane automata
- Title not available (Why is that?)
- On a class ofPautomata
- On the properties of language classes defined by bounded reaction automata
- Title not available (Why is that?)
- Automata generated \(p\)-languages
- Solving the N-queens problem using dP systems with active membranes
- Membrane automata for modeling biomolecular processes
- Red–Green P Automata
- Piecewise directable automata
- Title not available (Why is that?)
- Postfix automata
- P automata revisited
- Permutation automata
- P automata with restricted power
Recommendations
- P automata revisited 👍 👎
- On a class ofPautomata 👍 👎
- P automata: concepts, results, and new aspects 👍 👎
- Title not available (Why is that?) 👍 👎
- On Languages of P Automata 👍 👎
- Title not available (Why is that?) 👍 👎
- P automata with restricted power 👍 👎
- On the power of P automata 👍 👎
- DNA Computing 👍 👎
- On the computational complexity of P automata 👍 👎
This page was built for publication: Membrane Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316633)
