PC grammar systems with five context-free components generate all recursively enumerable languages. (Q1874424)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PC grammar systems with five context-free components generate all recursively enumerable languages. |
scientific article |
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
