Array-rewriting P systems with basic puzzle grammar rules and permitting features
From MaRDI portal
Recommendations
Cites work
- A \(P\) system model with pure context-free rules for picture array generation
- Array P Systems and t.Communication
- Array-rewriting P systems
- Contextual array grammars and array P systems
- Formal Models, Languages and Applications
- Grammar systems versus membrane computing: the case of CD grammar systems
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 3738961 (Why is no real title available?)
- scientific article; zbMATH DE number 2051899 (Why is no real title available?)
- scientific article; zbMATH DE number 1747451 (Why is no real title available?)
- scientific article; zbMATH DE number 2150284 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 745858 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- P Systems and Picture Languages
- P systems with array objects and array rewriting rules
Cited in
(7)- Array-rewriting P systems
- scientific article; zbMATH DE number 1747451 (Why is no real title available?)
- On parallel array P systems
- An overview of 2D picture array generating models based on membrane computing
- scientific article; zbMATH DE number 5219577 (Why is no real title available?)
- Array P systems and pure 2D context-free grammars with independent mode of rewriting
- P systems with array objects and array rewriting rules
This page was built for publication: Array-rewriting P systems with basic puzzle grammar rules and permitting features
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2975919)