{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:16Z","timestamp":1725455896728},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544784"},{"type":"electronic","value":"9783540383956"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0017412","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:32:12Z","timestamp":1132644732000},"page":"549-563","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Computing with graph relabelling systems with priorities"],"prefix":"10.1007","author":[{"given":"Igor","family":"Litovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"M\u00e9tivier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"40_CR1","unstructured":"M. Billaud, Some Backtracking Graphs Algorithms expressed by Graph Rewriting Systems with Priorities, Rapport Interne no 8989, LaBRI, Univ. Bordeaux I."},{"key":"40_CR2","unstructured":"M. Billaud, Un interpr\u00e9teur pour les Syst\u00e8mes de R\u00e9\u00e9criture de Graphes avec Priorit\u00e9s, Rapport Interne no 9040, LaBRI, Univ. Bordeaux I."},{"key":"40_CR3","unstructured":"M. Billaud, P. Lafon, Y. M\u00e9tivier and E. Sopena, Graph Rewriting Systems with Priorities: Definitions and Applications, Rapport Interne no 8909, LaBRI, Univ. Bordeaux I."},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"M. Billaud, P. Lafon, Y. M\u00e9tivier and E. Sopena, Graph Rewriting Systems with Priorities, in Graph-Theoretic Concepts in Computer Science, 15th Workshop on Graphs'89, LNCS no 411, pp. 94\u2013106.","DOI":"10.1007\/3-540-52292-1_7"},{"key":"40_CR5","unstructured":"B. Courcelle, Some applications of logic of universal algebra, and of category theory to the theory of graph transformations, Bulletin of E.A.T.C.S. no 36 (1988), pp. 161\u2013218."},{"key":"40_CR6","unstructured":"B. Courcelle, The monadic second-order logic of graphs V: on closing the gap between definability and recognizability, Rapport Interne no 8991, LaBRI, Univ. Bordeaux I."},{"key":"40_CR7","unstructured":"B. Courcelle, The monadic second-order logic of graphs VI: on several representations of graphs by relational stuctures. Rapport Interne no 8999, LaBRI, Univ. Bordeaux I."},{"issue":"1","key":"40_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle, The monadic second-order logic of graphs I. Recognizable sets of finite graphs, Information and Computation vol. 85 no 1 (1990), pp. 12\u201375.","journal-title":"Information and Computation"},{"key":"40_CR9","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"J. Doner, Tree Acceptors and Some of Their Applications, Journal of Computer and System Sciences 4 (1970), pp. 406\u2013451.","journal-title":"Journal of Computer and System Sciences"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0019-9958(68)90439-7","volume":"12","author":"J. Fris","year":"1968","unstructured":"J. Fris, Grammars with partial ordering of the rules, Information Control 12 (1968), pp. 415\u2013425.","journal-title":"Information Control"},{"key":"40_CR11","unstructured":"H. Gaifman, On local and non-local properties, Proc. of the Herbrand Symposium, Logic Colloquim'81, J. Stern ed., North-Holland Pub. Co. (1982), pp. 105\u2013135."},{"key":"40_CR12","unstructured":"F. G\u00e9cseg and M. Steinby, Tree automata, Akad\u00e9miai Kiado-Budapest (1984)."},{"issue":"1","key":"40_CR13","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","volume":"16","author":"J.E. Hopcroft","year":"1967","unstructured":"J.E. Hopcroft and J.D. Ullman, Some Results on Tape-Bounded Turing Machines, Journal of the Association for Computing Machinery, Vol. 16, no 1 (1967), pp. 168\u2013177.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"40_CR14","unstructured":"J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley (1979)."},{"key":"40_CR15","unstructured":"N. Immerman, Languages that capture complexity classes, SIAM J. Comput., vol. no 4 (1987), pp. 760\u2013778."},{"key":"40_CR16","unstructured":"I. Litovsky and Y. M\u00e9tivier, Computing with Graphs Rewriting Systems with Priorities, Rapport Interne du LaBRI, Univ. Bordeaux I."},{"key":"40_CR17","unstructured":"A.A. Markov, Theory of Algorithms, Jerusalem: Israel Program for Scientific Translations (1961)."},{"key":"40_CR18","unstructured":"A. Salomaa, Formal Languages, Academic Press (1979)."},{"key":"40_CR19","unstructured":"W. Tutte, Graph Theory, Addison Wesley (1984)."},{"key":"40_CR20","unstructured":"A. Yasuhara, Recursive function theory & logic, Academic Press (1971)."}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:19:08Z","timestamp":1558271948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544784","9783540383956"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0017412","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}