On sets of numbers accepted by P/T systems composed by join
From MaRDI portal
Publication:410705
DOI10.1016/j.tcs.2010.07.016zbMath1234.68297MaRDI QIDQ410705
Oscar H. Ibarra, Pierluigi Frisco
Publication date: 3 April 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.07.016
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- P systems with symport/antiport simulating counter automata
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Unexpected universality results for three classes of P systems with symport/antiport
- Some decision problems concerning semilinearity and commutation.
- Computing with Cells
- Simple matrix languages
- Membrane Computing