{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:00:40Z","timestamp":1648843240500},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4702,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0304-3975(99)00076-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:13:43Z","timestamp":1027592023000},"page":"131-150","source":"Crossref","is-referenced-by-count":1,"title":["Grouped partial ET0L systems and parallel multiple context-free grammars"],"prefix":"10.1016","volume":"246","author":[{"given":"T.Y.","family":"Nishida","sequence":"first","affiliation":[]},{"given":"S.","family":"Seki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00076-6_BIB1","first-page":"13","article-title":"A pumping theorem for deterministic ET0L languages","volume":"9","author":"Ehrenfeucht","year":"1975","journal-title":"RAIRO Ser. Rouge"},{"key":"10.1016\/S0304-3975(99)00076-6_BIB2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1051\/ita\/1977110402731","article-title":"On some context-free languages that are not deterministic ET0L languages","volume":"11","author":"Ehrenfeucht","year":"1977","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/S0304-3975(99)00076-6_BIB3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(76)90076-1","article-title":"A relationship between ET0L and EDT0L languages","volume":"1","author":"Ehrenfeucht","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00076-6_BIB4","first-page":"191","article-title":"Membership for 1-limited ET0L languages is not decidable","volume":"30","author":"Fernau","year":"1994","journal-title":"J. Inform. Process. Cybernet. EIK"},{"key":"10.1016\/S0304-3975(99)00076-6_BIB5","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0020-0190(75)90027-7","article-title":"The membership question for ET0L languages is polynomially complete","volume":"3","author":"van Leeuwen","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00076-6_BIB6","unstructured":"M. Levitina, O nekotoryh grammatikah s pravilami globalnoi podstanovki, Akad. Nauk SSSR Nauchno-Tekhn. Inform. Ser. 2 (1973) 32\u201326."},{"key":"10.1016\/S0304-3975(99)00076-6_BIB7","unstructured":"C.J. Pollard, Generalized phrase structure grammars, head grammars, and natural language, Ph D. Dissertation, Stanford University, 1984."},{"key":"10.1016\/S0304-3975(99)00076-6_BIB8","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/363921.363925","article-title":"An extension of ALGOL-like languages","volume":"7","author":"Rose","year":"1964","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(99)00076-6_BIB9","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/S0304-3975(99)00076-6_BIB10","first-page":"523","article-title":"Parallelism in rewriting systems","volume":"vol. 14","author":"Salomaa","year":"1974"},{"key":"10.1016\/S0304-3975(99)00076-6_BIB11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","article-title":"On multiple context-free grammars","volume":"88","author":"Seki","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00076-6_BIB12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0019-9958(74)80054-9","article-title":"Parallel context-free languages","volume":"24","author":"Siromoney","year":"1974","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(99)00076-6_BIB13","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/S0019-9958(74)91399-0","article-title":"Parallel context-free languages","volume":"26","author":"Skyum","year":"1974","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(99)00076-6_BIB14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1137\/0205022","article-title":"Decomposition theorems for various kinds of languages parallel in nature","volume":"5","author":"Skyum","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00076-6_BIB15","first-page":"124","article-title":"Phrase structure languages by a concurrent derivation","volume":"54-C","author":"Torii","year":"1971","journal-title":"Trans. IECE Japan"},{"key":"10.1016\/S0304-3975(99)00076-6_BIB16","first-page":"267","article-title":"k-limited 0L systems and languages","volume":"24","author":"W\u00e4tjen","year":"1988","journal-title":"J. Inform. Process. Cybernet. EIK"},{"key":"10.1016\/S0304-3975(99)00076-6_BIB17","first-page":"229","article-title":"On k-uniformly-limited T0L systems and languages","volume":"26","author":"W\u00e4tjen","year":"1990","journal-title":"J. Inform. Process. Cybernet. EIK"},{"key":"10.1016\/S0304-3975(99)00076-6_BIB18","first-page":"283","article-title":"On extended k-uniformly-limited T0L systems and languages","volume":"26","author":"W\u00e4tjen","year":"1990","journal-title":"J. Inform. Process. Cybernet. EIK"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000766?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000766?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T10:23:51Z","timestamp":1556447031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0304397599000766"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00076-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}