Polymorphic systems with arrays, 2-counter machines and multiset rewriting

zbMATH Open1272.68268MaRDI QIDQ2851065FDOQ2851065

Authors: Ranko Lazić, Tom Newcomb, Bill Roscoe 

Publication date: 2 October 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105052011

Recommendations

• Decidability of reachability for polymorphic systems with arrays: a complete classification
• ON STATELESS AUTOMATA AND P SYSTEMS
• Process rewrite systems.
• Array-rewriting P systems
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (2)

• Polymorphic P Systems with Non-cooperative Rules and No Ingredients
• Decidability of reachability for polymorphic systems with arrays: a complete classification

This page was built for publication: Polymorphic systems with arrays, 2-counter machines and multiset rewriting

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