PC grammar systems with five context-free components generate all recursively enumerable languages. (Q1874424)
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: PC grammar systems with five context-free components generate all recursively enumerable languages. |
scientific article; zbMATH DE number 1915598
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PC grammar systems with five context-free components generate all recursively enumerable languages. |
scientific article; zbMATH DE number 1915598 |
Statements
PC grammar systems with five context-free components generate all recursively enumerable languages. (English)
0 references
25 May 2003
0 references
Parallel communicating grammar systems
0 references
Descriptional complexity
0 references
Recursively enumerable languages
0 references
0 references
