{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:29:45Z","timestamp":1725467385386},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612285"},{"type":"electronic","value":"9783540683889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_97","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T14:17:05Z","timestamp":1153145825000},"page":"336-350","source":"Crossref","is-referenced-by-count":1,"title":["Graph automata for linear graph languages"],"prefix":"10.1007","author":[{"given":"F. J.","family":"Brandenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Skodinis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"D. Bienstock, P. Seymour. Monotonicity in graph searching. J. Algorithms 12 (1991), 239\u2013245.","journal-title":"J. Algorithms"},{"key":"23_CR2","first-page":"416","volume":"894","author":"F.J. Brandenburg","year":"1995","unstructured":"F.J. Brandenburg. Designing graph drawings by layout graph grammars. Proc. Workshop on Graph Drawing 94, LNCS 894 (1995), 416\u2013427.","journal-title":"LNCS"},{"key":"23_CR3","first-page":"193","volume-title":"Handbook of Theoretical Computer Science","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. Graph rewriting: an algebraic and logic approach. Handbook of Theoretical Computer Science, Elsevier, Amsterdam, (1990) 193\u2013242."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.J. Kreowski, G. Rozenberg. Proc. 4. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 532 (1991).","DOI":"10.1007\/BFb0017372"},{"key":"23_CR5","first-page":"148","volume":"380","author":"J. Engelfriet","year":"1989","unstructured":"J. Engelfriet. Context-free NCE graph grammars. Proc. FCT 89, LNCS 380 (1989), 148\u2013161.","journal-title":"Proc. FCT 89, LNCS"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0890-5401(89)90030-8","volume":"81","author":"J. Engelfriet","year":"1989","unstructured":"J. Engelfriet, G. Leih. Linear graph grammars: power and complexity. Inform. Com-put. 81 (1989), 88\u2013121.","journal-title":"Inform. Com-put."},{"key":"23_CR7","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg, M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)."},{"key":"23_CR8","unstructured":"T. Hickl. Rechtwinkliges Layout von hierarchisch strukturierten Graphen. Dissertation, Universit\u00e4t Passau (1994)."},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0022-0000(86)90060-7","volume":"33","author":"D. Janssens","year":"1986","unstructured":"D. Janssens, G. Rozenberg, E. Welzl. The bounded degree problem for NLC graph grammars is decidable. J. Comput. System Sci. 33 (1986), 415\u2013422.","journal-title":"J. Comput. System Sci."},{"key":"23_CR10","first-page":"326","volume":"291","author":"M. Kaul","year":"1987","unstructured":"M. Kaul. Practical applications of precedence graph grammars. Proc. 3. Workshop on Graph Grammars and their Application to Computer Science, LNCS 291 (1987), 326\u2013342.","journal-title":"LNCS"},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A.S. LaPaugh","year":"1993","unstructured":"A.S. LaPaugh. Recontamination does not help to search a graph. J. Assoc. Comput. Mach. 40 (1993), 224\u2013245.","journal-title":"J. Assoc. Comput. Mach."},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, S.L. Hakimi, M. R. Garey, D.S. Johnson, C.H. Papadimitriou. The complexity of searching a graph. J. Assoc. Comput. Mach. 35 (1988), 18\u201344.","journal-title":"J. Assoc. Comput. Mach."},{"key":"23_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-01443-0","volume-title":"Graph Grammatiken","author":"M. Nagl","year":"1979","unstructured":"M. Nagl. Graph Grammatiken. Vieweg, Braunschweig (1979)."},{"key":"23_CR14","unstructured":"J.L. Pfaltz, A. Rosenfeld. Web Grammars. Proc. Joint Intern. Conference on Artificial Intelligence, Washington, D.C., (1969), 609\u2013619."},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(94)00045-K","volume":"136","author":"E. Remila","year":"1994","unstructured":"E. Remila. Fundamental study \u2014 Recognition of graphs by automata. Theor. Comput. Sci. 136 (1994), 291\u2013332.","journal-title":"Theor. Comput. Sci."},{"key":"23_CR16","first-page":"307","volume":"7","author":"A. Rosenfeld","year":"1972","unstructured":"A. Rosenfeld, D.L. Milgram. Web automata and web grammars. Machine Intelligence 7 (1972), 307\u2013324.","journal-title":"Machine Intelligence"},{"key":"23_CR17","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg, E. Welzl. Boundary NLC graph grammars-Basic definitions, normal forms and complexity. Inform. Control 69 (1986), 136\u2013167.","journal-title":"Inform. Control"},{"key":"23_CR18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0019-9958(79)90288-2","volume":"42","author":"A. Wu","year":"1979","unstructured":"A. Wu, R. Rosenfeld. Cellular graph automata I. Inform. Control 42 (1979), 305\u2013329.","journal-title":"Inform. Control"},{"key":"23_CR19","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/S0019-9958(79)90296-1","volume":"42","author":"A. Wu","year":"1979","unstructured":"A. Wu, R. Rosenfeld. Cellular graph automata II. Inform. Control 42 (1979), 330\u2013353.","journal-title":"Inform. Control"}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61228-9_97","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T02:02:09Z","timestamp":1555725729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_97"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_97","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}