On the computational power of context-free PC grammar systems (Q1566712): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4886800 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4319710 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3893911 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4714446 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3686043 / 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: Register machine proof of the theorem on exponential diophantine representation of enumerable sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5613949 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3982094 / rank | |||
Normal rank | |||
Revision as of 16:34, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational power of context-free PC grammar systems |
scientific article |
Statements
On the computational power of context-free PC grammar systems (English)
0 references
4 June 2000
0 references
parallel grammar systems
0 references
system of diophantic equations
0 references
synchronization
0 references
0 references
