On the generative capacity of parallel communicating grammar systems
From MaRDI portal
Publication:4032906
DOI10.1080/00207169208804117zbMATH Open0796.68137OpenAlexW1988637488MaRDI QIDQ4032906FDOQ4032906
Authors: Gheorghe Păun, Sorina Dumitrescu, Arto Salomaa 
Publication date: 16 May 1993
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169208804117
Recommendations
Cited In (19)
- Title not available (Why is that?)
- Time-bounded parallel rewriting
- Parallel communicating grammar systems with incomplete information communication
- The computational complexity of PCGS with regular components
- On simulating non-returning PC grammar systems with returning systems
- On the number of components for some parallel communicating grammar systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paraconsistency and plausible argumentation in generative grammar: A case study
- Title not available (Why is that?)
- Parallel communicating grammar systems: the context-sensitive case
- Some decision problems for parallel communicating grammar systems
- On the synchronization in parallel communicating grammar systems
- On the generative capacity of parallel communicating grammar systems
- Generative languages, codes and parallel processing
- Title not available (Why is that?)
- Multigenerative grammar systems and matrix grammars
- Title not available (Why is that?)
- Parallel communicating grammar systems with terminal transmission
This page was built for publication: On the generative capacity of parallel communicating grammar systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032906)
