Minimal Multiset Grammars for Recurrent Dynamics

DOI10.1007/978-3-319-54072-6_12zbMath1483.68115OpenAlexW2588593881MaRDI QIDQ2975911

Giuditta Franco, Alessandro Farinelli, Romeo Rizzi

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_12

zbMATH Keywords

optimizationNP-hardnessmultiset grammarmetabolic computing

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Symbolic dynamics (37B10) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Infobiotics. Information in biotic systems
• Minimum-support solutions of polyhedral concave programs^*
• Matter and Anti-Matter in Membrane Systems
• Regulation and Covering Problems in MP Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal Multiset Grammars for Recurrent Dynamics