Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
Cart
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Home
Journals
Acta Universitatis Sapientiae, Informatica
Volume 8 (2016): Issue 2 (December 2016)
Open Access
Parallel communicating grammar systems with context-free components are Turing complete for any communication model
Mary Sarah Ruth Wilkin
Mary Sarah Ruth Wilkin
and
Stefan D. Bruda
Stefan D. Bruda
| Dec 30, 2016
Acta Universitatis Sapientiae, Informatica
Volume 8 (2016): Issue 2 (December 2016)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Dec 30, 2016
Page range:
113 - 170
Received:
Oct 10, 2016
DOI:
https://doi.org/10.1515/ausi-2016-0007
Keywords
formal languages
,
theory of computation
,
formal grammar
,
parallel communicating grammar system
,
Turing completeness
© 2017
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
Mary Sarah Ruth Wilkin
Department of Computer Science Bishop's University Sherbrooke, Quebec J1M 1Z7,
Canada
Stefan D. Bruda
Department of Computer Science Bishop's University Sherbrooke, Quebec J1M 1Z7,
Canada