Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components (Q3517110)
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 5309922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components |
scientific article; zbMATH DE number 5309922 |
Statements
12 August 2008
0 references
parallel communicating grammar systems
0 references
descriptional complexity
0 references
0.8960003852844238
0 references
0.8899310231208801
0 references
0.884164571762085
0 references
0.8269178867340088
0 references
