Descriptional complexity of matrix simple semi-conditional grammars (Q2179331)
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: Descriptional complexity of matrix simple semi-conditional grammars |
scientific article; zbMATH DE number 7199410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descriptional complexity of matrix simple semi-conditional grammars |
scientific article; zbMATH DE number 7199410 |
Statements
Descriptional complexity of matrix simple semi-conditional grammars (English)
0 references
12 May 2020
0 references
simple semi-conditional grammars
0 references
matrix grammars
0 references
computational completeness
0 references
Geffert normal forms
0 references
descriptional complexity
0 references
0.8802440762519836
0 references
0.8539773225784302
0 references
0.8000576496124268
0 references
0.7975407242774963
0 references
0.7925097346305847
0 references
