Parallel rewriting P systems with deadlock

DOI10.1007/3-540-36440-4_27MaRDI QIDQ4414690zbMATH OpenFDO

Authors Daniela Besozzi, Claudio Ferretti, Giancarlo Mauri, Claudio Zandron

Publication date 25 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2568/25680302.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• DNA Computing
• Parallel rewriting P systems without target conflicts
• A note on parallel rewriting in P systems
• Hierarchies of parallel rewriting P systems -- a survey
• Membrane Computing

Cited in

(9)

• Hierarchies of parallel rewriting P systems -- a survey
• Independent parallelism in finite copying parallel rewriting systems
• Language generating alphabetic flat splicing P systems
• Rewriting P systems with flat-splicing rules
• Parallel rewriting P systems without target conflicts
• An overview of 2D picture array generating models based on membrane computing
• DNA Computing
• Membrane Computing
• On maximal parallel application of rules in rewriting P systems

This page was built for publication: Parallel rewriting P systems with deadlock

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