Universality and computational completeness of controlled leftist insertion-deletion systems (Q4601152)
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: Universality and computational completeness of controlled leftist insertion-deletion systems |
scientific article; zbMATH DE number 6827734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Universality and computational completeness of controlled leftist insertion-deletion systems |
scientific article; zbMATH DE number 6827734 |
Statements
Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems (English)
0 references
19 January 2018
0 references
0.9036290645599364
0 references
0.8241358995437622
0 references
0.8205471038818359
0 references
0.8143830895423889
0 references
0.8100457191467285
0 references
