{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T23:18:03Z","timestamp":1768259883994,"version":"3.49.0"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/bf00289591","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T00:07:05Z","timestamp":1096934825000},"page":"63-85","source":"Crossref","is-referenced-by-count":26,"title":["A characterization of context-free string languages by directed node-label controlled graph grammars"],"prefix":"10.1007","volume":"16","author":[{"given":"D.","family":"Janssens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Graph grammars and their application to computer science and biology. Lecture Notes in Computer Science Vol. 73","year":"1979","unstructured":"Claus, V., Ehrig, H., Rozenberg, G. (Eds.): Graph grammars and their application to computer science and biology. Lecture Notes in Computer Science Vol. 73, Berlin-Heidelberg-New York: Springer 1979"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Ehrig, H.: Introduction to the algebraic theory of graph grammars. 1?69. In [1] (1979)","DOI":"10.1007\/BFb0025714"},{"key":"CR3","unstructured":"Ehrenfeucht, A., Rozenberg, G.: The sequence equivalence problem is decidable for OS systems. J. Assoc. Comput. Mach. (in press, 1981)"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","volume":"20","author":"D. Janssens","year":"1980","unstructured":"Janssens, D., Rozenberg, G.: Restrictions, extensions and variations of NLC grammars. Information Sci. 20, 217?244 (1980)","journal-title":"Information Sci."},{"key":"CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-01443-0","volume-title":"Graph-Grammatiken","author":"M. Nagl","year":"1979","unstructured":"Nagl, M.: Graph-Grammatiken. Braunschweig\/Wiesbaden: Vieweg 1979"},{"key":"CR6","volume-title":"Picture languages","author":"A. Rosenfeld","year":"1979","unstructured":"Rosenfeld, A.: Picture languages. New York-London: Academic Press 1979"},{"key":"CR7","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal languages, New York-London: Academic Press 1973"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289591.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289591\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:57Z","timestamp":1554743697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289591"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981]]}},"alternative-id":["BF00289591"],"URL":"https:\/\/doi.org\/10.1007\/bf00289591","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981]]}}}