Scattered context grammars with one non-context-free production are computationally complete (Q5164863)
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 7426115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scattered context grammars with one non-context-free production are computationally complete |
scientific article; zbMATH DE number 7426115 |
Statements
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete (English)
0 references
15 November 2021
0 references
scattered context grammars
0 references
size reduction
0 references
the number of non-context-free productions
0 references
parallel productions
0 references
computational completeness
0 references
descriptional complexity
0 references
0 references
0 references
0.8809313774108887
0 references
0.852758526802063
0 references
0.828451931476593
0 references
0.8194360136985779
0 references
