Rewriting P systems with flat-splicing rules

DOI10.1007/978-3-319-54072-6_21MaRDI QIDQ2975923zbMATH OpenOpenAlexFDO

Authors Bosheng Song, K. G. Subramanian, Linqiang Pan

Publication date 12 April 2017

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-54072-6_21

zbMATH Keywords

bio-inspired computingChomsky hierarchyflat splicingmembrane computingP-system

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Language generating alphabetic flat splicing P systems
• On three variants of rewriting P systems
• scientific article; zbMATH DE number 2155204
• scientific article; zbMATH DE number 1819635
• A note on parallel rewriting in P systems

Cites work

• An unsupervised learning algorithm for membrane computing
• Circular suggestions for DNA computing
• Computing with membranes
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• From regulated rewriting to computing with membranes: collapsing hierarchies
• Fuzzy reasoning spiking neural P system for fault diagnosis
• scientific article; zbMATH DE number 1735640 (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?)
• Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers
• P systems with global rules
• Rewriting P systems with flat-splicing rules
• Splicing systems and the Chomsky hierarchy

Cited in

(6)

• Grammar systems based on equal matrix rules and alphabetic flat splicing
• Language generating alphabetic flat splicing P systems
• Rewriting P systems with flat-splicing rules
• An overview of 2D picture array generating models based on membrane computing
• GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA
• On maximal parallel application of rules in rewriting P systems

This page was built for publication: Rewriting P systems with flat-splicing rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2975923)