PC grammar systems with five context-free components generate all recursively enumerable languages. (Q1874424): Difference between revisions
From MaRDI portal
Latest revision as of 10:13, 30 July 2024
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