On the computational completeness of context-free parallel communicating grammar systems (Q1287096)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computational completeness of context-free parallel communicating grammar systems |
scientific article; zbMATH DE number 1282187
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational completeness of context-free parallel communicating grammar systems |
scientific article; zbMATH DE number 1282187 |
Statements
On the computational completeness of context-free parallel communicating grammar systems (English)
0 references
29 April 1999
0 references
recursively enumerable languages
0 references
context-free returning parallel communicating grammar systems
0 references
