Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space

DOI10.1142/S0129626416500122zbMath1376.68078OpenAlexW2522877794MaRDI QIDQ4598924

Mary Sarah Ruth Wilkin, Stefan D. Bruda

Publication date: 15 December 2017

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626416500122

zbMATH Keywords

formal languages theory of computation Turing completeness formal grammar parallel communicating grammar system coverability trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

This page was built for publication: Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space