Parallel communicating grammar systems with context-free components are Turing complete for any communication model (Q508542)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel communicating grammar systems with context-free components are Turing complete for any communication model |
scientific article |
Statements
Parallel communicating grammar systems with context-free components are Turing complete for any communication model (English)
0 references
7 February 2017
0 references
formal languages
0 references
theory of computation
0 references
formal grammar
0 references
parallel communicating grammar system
0 references
Turing completeness
0 references
0 references
0 references
