Language generating alphabetic flat splicing P systems
From MaRDI portal
Recommendations
- Grammar systems based on equal matrix rules and alphabetic flat splicing
- Languages generated by P systems with active membranes
- scientific article; zbMATH DE number 2040901
- scientific article; zbMATH DE number 907948
- Generating languages by P systems with minimal symport/antiport
- Theoretical Aspects of Computing – ICTAC 2005
- On String Languages Generated by Sequential Numerical P Systems
- Splicing in abstract families of languages
- Rewriting P systems with flat-splicing rules
- Deciding whether a regular language is generated by a splicing system
Cites work
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1735640 (Why is no real title available?)
- scientific article; zbMATH DE number 1740165 (Why is no real title available?)
- scientific article; zbMATH DE number 1740167 (Why is no real title available?)
- scientific article; zbMATH DE number 1953228 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A transformation system for generating description languages of chain code pictures
- Circular suggestions for DNA computing
- Computational power of tissue P systems for generating control languages
- Computing with membranes
- DNA Computing
- Decision problems and regular chain code picture languages
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- From regulated rewriting to computing with membranes: collapsing hierarchies
- Marcus contextual grammars
- Membrane computing. An introduction.
- On languages generated by asynchronous spiking neural P systems
- On languages generated by spiking neural P systems with weights
- On string languages generated by sequential spiking neural P systems based on the number of spikes
- On three variants of rewriting P systems
- P Systems and Picture Languages
- P Systems with String Objects and with Communication by Request
- P systems with global rules
- P systems with parallel rewriting for chain code picture languages
- Pure grammars
- Splicing systems and the Chomsky hierarchy
- Using string languages to describe picture languages
Cited in
(4)- On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2
- Grammar systems based on equal matrix rules and alphabetic flat splicing
- Rewriting P systems with flat-splicing rules
- Derivation languages and descriptional complexity measures of restricted flat splicing systems
This page was built for publication: Language generating alphabetic flat splicing P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413312)
