A General Framework for Regulated Rewriting Based on the Applicability of Rules

DOI10.1007/978-3-642-20000-7_5zbMath1330.68133OpenAlexW1846755350MaRDI QIDQ3009336

Rudolf Freund, Marion Oswald, Marian Kogler

Publication date: 24 June 2011

Published in: Computation, Cooperation, and Life (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20000-7_5

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Contextual array grammars with matrix control, regular control languages, and tissue P systems control ⋮ Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems ⋮ Promoters and Inhibitors in Purely Catalytic P Systems ⋮ Non-isometric Contextual Array Grammars with Regular Control and Local Selectors ⋮ Unnamed Item ⋮ Variants of P systems with activation and blocking of rules ⋮ Time-freeness and clock-freeness and related concepts in P systems ⋮ Contextual Array Grammars with Matrix and Regular Control

Cites Work

• Multiset random context grammars, checkers, and transducers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item