(Mem)brane automata
From MaRDI portal
Publication:953539
DOI10.1016/j.tcs.2008.04.004zbMath1151.68015OpenAlexW2031963800MaRDI QIDQ953539
György Vaszil, Erzsébet Csuhaj-Varjú
Publication date: 6 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.004
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items
P systems with proteins on membranes characterize PSPACE, Membrane automata for modeling biomolecular processes, P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing with membranes
- Membrane computing. An introduction.
- Membrane Systems with Marked Membranes
- AN UNIVERSALITY RESULT FOR A (MEM)BRANE CALCULUS BASED ON MATE/DRIP OPERATIONS
- P Finite Automata and Regular Languages over Countably Infinite Alphabets
- P Systems with Proteins on Membranes and Membrane Division
- Membrane Computing
- Turing machines with restricted memory access
- Brane Calculi