On the computational completeness of context-free parallel communicating grammar systems (Q1287096): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(98)00193-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995375035 / rank | |||
Normal rank | |||
Latest revision as of 10:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational completeness of context-free parallel communicating grammar systems |
scientific article |
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
