Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space (Q4598924)
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: Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space |
scientific article; zbMATH DE number 6819491
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space |
scientific article; zbMATH DE number 6819491 |
Statements
Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space (English)
0 references
15 December 2017
0 references
theory of computation
0 references
formal languages
0 references
formal grammar
0 references
Turing completeness
0 references
parallel communicating grammar system
0 references
coverability trees
0 references
