On the computational completeness of context-free parallel communicating grammar systems (Q1287096): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4290611 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4714446 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nonreturning PC grammar systems can be simulated by returning systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Turing machines with restricted memory access / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5592246 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the computational power of context-free PC grammar systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4226189 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3982094 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5678435 / rank | |||
Normal rank | |||
Revision as of 19:52, 28 May 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
