Catalytic and communicating Petri nets are Turing complete (Q476166)
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: Catalytic and communicating Petri nets are Turing complete |
scientific article; zbMATH DE number 6375056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Catalytic and communicating Petri nets are Turing complete |
scientific article; zbMATH DE number 6375056 |
Statements
Catalytic and communicating Petri nets are Turing complete (English)
0 references
28 November 2014
0 references
0.9026144742965698
0 references
0.8007380366325378
0 references
0.7896966338157654
0 references
0.7752816677093506
0 references
0.7679980397224426
0 references
