Grouped partial ET0L systems and parallel multiple context-free grammars
From MaRDI portal
Publication:1583595
DOI10.1016/S0304-3975(99)00076-6zbMATH Open0959.68058WikidataQ127219977 ScholiaQ127219977MaRDI QIDQ1583595FDOQ1583595
Authors: Taishin Yasunobu Nishida, Shigeko Seki 
Publication date: 31 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 5271
- Logical Aspects of Computational Linguistics
- Parallel communicating grammar systems: the context-sensitive case
- scientific article; zbMATH DE number 878951
- scientific article; zbMATH DE number 4121469
- PARALLEL CONTEXTUAL ARRAY GRAMMARS AND LANGUAGES
- scientific article; zbMATH DE number 2040912
- On multiple context-free grammars
- On the computational completeness of context-free parallel communicating grammar systems
- Descriptional complexity of multi-parallel grammars
Cites Work
- On multiple context-free grammars
- Title not available (Why is that?)
- A relationship between ETOL and EDTOL languages
- Decomposition Theorems for Various Kinds of Languages Parallel in Nature
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The membership question for ETOL-languages is polynomially complete
- Parallel context-free languages
- Parallel context-free languages
- Title not available (Why is that?)
- An extension of ALGOL-like languages
Cited In (2)
This page was built for publication: Grouped partial ET0L systems and parallel multiple context-free grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583595)
