{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:34:12Z","timestamp":1648812852743},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0022-0000(90)90004-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"376-404","source":"Crossref","is-referenced-by-count":5,"title":["The complexity of regular DNLC graph languages"],"prefix":"10.1016","volume":"40","author":[{"given":"Ijsbrand","family":"Jan Aalbersberg","sequence":"first","affiliation":[]},{"given":"Joost","family":"Engelfriet","sequence":"additional","affiliation":[]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90004-5_BIB1","article-title":"The Complexity of Regular DNLC Graph Grammars","author":"Aalbersberg","year":"1986"},{"key":"10.1016\/0022-0000(90)90004-5_BIB2","series-title":"Proceedings, 3rd Internat. Workshop on Graph-Grammars and Their Application to Computer Science","first-page":"147","article-title":"Restricting the complexity of regular DNLC languages","volume":"Vol. 291","author":"Aalbersberg","year":"1987"},{"key":"10.1016\/0022-0000(90)90004-5_BIB3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(86)90070-3","article-title":"On the membership problem of regular DNLC grammars","volume":"13","author":"Aalbersberg","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0022-0000(90)90004-5_BIB4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(85)90080-0","article-title":"Traces, dependency graphs and DNLC grammars","volume":"11","author":"Aalbersberg","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0022-0000(90)90004-5_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","article-title":"Theory of traces","volume":"60","author":"Aalbersberg","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90004-5_BIB6","series-title":"Proceedings, STACS '88","first-page":"227","article-title":"On polynomial time graph grammars","volume":"Vol. 294","author":"Brandenburg","year":"1988"},{"key":"10.1016\/0022-0000(90)90004-5_BIB7","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","article-title":"Characterizations of pushdown machines in terms of time-bounded computers","volume":"18","author":"Cook","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90004-5_BIB8","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0890-5401(89)90030-8","article-title":"Linear Graph Grammars: Power and Complexity","volume":"81","author":"Engelfriet","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0022-0000(90)90004-5_BIB9","article-title":"Complexity of Boundary Graph Languages","author":"Engelfriet","year":"1988"},{"key":"10.1016\/0022-0000(90)90004-5_BIB10","series-title":"Computers and Intractability-A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(90)90004-5_BIB11","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0022-0000(90)90004-5_BIB12","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(90)90004-5_BIB13","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complement","volume":"17","author":"Immermann","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90004-5_BIB14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00289591","article-title":"A characterization of context-free string languages by directed node-label controlled graph grammars","volume":"16","author":"Janssens","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(90)90004-5_BIB15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(87)90051-5","article-title":"String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing","volume":"16","author":"Lange","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0022-0000(90)90004-5_BIB16","series-title":"Proceedings, 15th ICALP","first-page":"362","article-title":"Efficient algorithms on context-free graph languages","volume":"Vol. 317","author":"Lautemann","year":"1988"},{"key":"10.1016\/0022-0000(90)90004-5_BIB17","doi-asserted-by":"crossref","DOI":"10.7146\/dpb.v6i78.7691","article-title":"Concurrent Program Schemes and Their Interpretations","author":"Mazurkiewicz","year":"1977"},{"key":"10.1016\/0022-0000(90)90004-5_BIB18","series-title":"Petri Nets, An Introduction","author":"Reisig","year":"1985"},{"key":"10.1016\/0022-0000(90)90004-5_BIB19","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","article-title":"Boundary NLC graph grammars: Basic definitions, normal forms, and complexity","volume":"69","author":"Rozenberg","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(90)90004-5_BIB20","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0022-0000(90)90004-5_BIB21","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"On tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90004-5_BIB22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000090900045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000090900045?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:55:43Z","timestamp":1550325343000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000090900045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0022000090900045"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90004-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}