On the computational completeness of matrix simple semi-conditional grammars (Q2113382)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7488454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational completeness of matrix simple semi-conditional grammars |
scientific article; zbMATH DE number 7488454 |
Statements
On the computational completeness of matrix simple semi-conditional grammars (English)
0 references
14 March 2022
0 references
semi-conditional grammars
0 references
matrix grammars
0 references
computational completeness
0 references
descriptional complexity
0 references
0 references
0 references
0 references
0.969467282295227
0 references
0.8400699496269226
0 references
0.8291082382202148
0 references
0.8158318400382996
0 references
0.8046479821205139
0 references
