Language generating alphabetic flat splicing P systems
From MaRDI portal
Publication:2413312
DOI10.1016/j.tcs.2017.12.014zbMath1390.68312OpenAlexW2775514727MaRDI QIDQ2413312
K. G. Subramanian, Atulya K. Nagar, Bosheng Song, Lin-Qiang Pan
Publication date: 10 April 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.014
Related Items
On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 ⋮ Derivation languages and descriptional complexity measures of restricted flat splicing systems
Cites Work
- Splicing systems and the Chomsky hierarchy
- Computational power of tissue P systems for generating control languages
- On languages generated by spiking neural P systems with weights
- Decision problems and regular chain code picture languages
- P systems with global rules
- On languages generated by asynchronous spiking neural P systems
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- A transformation system for generating description languages of chain code pictures
- On three variants of rewriting P systems
- Computing with membranes
- Marcus contextual grammars
- Membrane computing. An introduction.
- From regulated rewriting to computing with membranes: collapsing hierarchies
- On string languages generated by sequential spiking neural P systems based on the number of spikes
- P Systems with Parallel Rewriting for Chain Code Picture Languages
- P Systems and Picture Languages
- Using string languages to describe picture languages
- Pure grammars
- P Systems with String Objects and with Communication by Request
- DNA Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
