{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:03:06Z","timestamp":1768276986842,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"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":[[1993,7]]},"DOI":"10.1016\/0304-3975(93)90116-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"191-224","source":"Crossref","is-referenced-by-count":16,"title":["Computing with graph rewriting systems with priorities"],"prefix":"10.1016","volume":"115","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":"78","reference":[{"key":"10.1016\/0304-3975(93)90116-B_BIB1","series-title":"Rapport Interne no. 8989","article-title":"Some backtracking graphs algorithms expressed by graph rewriting systems with priorities","author":"Billaud","year":"1989"},{"key":"10.1016\/0304-3975(93)90116-B_BIB2","series-title":"Rapport Interne no. 9040","article-title":"Un interpr\u00e9teur pour les Syst\u00e8mes de R\u00e9\u00e9criture de Graphes avec Priorit\u00e9s","author":"Billaud","year":"1990"},{"key":"10.1016\/0304-3975(93)90116-B_BIB3","series-title":"Rapport Interne no. 8909","article-title":"Graph rewriting systems with priorities: definitions and applications","author":"Billaud","year":"1989"},{"key":"10.1016\/0304-3975(93)90116-B_BIB4","series-title":"Graph-Theoretic Concepts in Computer Science, 15th Workshop on Graphs '89","first-page":"94","article-title":"Graph rewriting systems with priorities","volume":"Vol. 411","author":"Billaud","year":"1989"},{"key":"10.1016\/0304-3975(93)90116-B_BIB5","first-page":"161","article-title":"Some applications of logic of universal algebra, and of category theory to the theory of graph transformations","volume":"36","author":"Courcelle","year":"1988","journal-title":"Bull. EATCS"},{"key":"10.1016\/0304-3975(93)90116-B_BIB6","series-title":"Rapport Interne no. 8991","article-title":"The monadic second-order logic of graphs V: on closing the gap between definability and recognizability","author":"Courcelle","year":"1989"},{"key":"10.1016\/0304-3975(93)90116-B_BIB7","series-title":"Rapport Interne no. 8999","article-title":"The monadic second-order logic of graphs VI: on several representations of graphs by relational structures","author":"Courcelle","year":"1989"},{"key":"10.1016\/0304-3975(93)90116-B_BIB8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs I. Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90116-B_BIB9","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","article-title":"Tree Acceptors and Some of Their Applications","volume":"4","author":"Doner","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90116-B_BIB10","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0019-9958(68)90439-7","article-title":"Grammars with partial ordering of the rules","volume":"12","author":"Fris","year":"1968","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90116-B_BIB11","series-title":"Proc. Herbrand Symp. Logic Coll. '81","first-page":"105","article-title":"On local and non-local properties","author":"Gaifman","year":"1982"},{"key":"10.1016\/0304-3975(93)90116-B_BIB12","series-title":"Tree Automata","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/0304-3975(93)90116-B_BIB13","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","article-title":"Some results on tape-bounded Turing machines","volume":"16","author":"Hopcroft","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90116-B_BIB14","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(93)90116-B_BIB15","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages that capture complexity classes","volume":"4","author":"Immerman","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90116-B_BIB16","series-title":"Rapport Interne no. 9085","article-title":"Computing trees with graph rewriting systems with priorities","author":"Litovsky","year":"1990"},{"key":"10.1016\/0304-3975(93)90116-B_BIB17","series-title":"Theory of Algorithms","author":"Markov","year":"1961"},{"key":"10.1016\/0304-3975(93)90116-B_BIB18","series-title":"Formal Languages","author":"Salomaa","year":"1979"},{"key":"10.1016\/0304-3975(93)90116-B_BIB19","series-title":"Graph Theory","author":"Tutte","year":"1984"},{"key":"10.1016\/0304-3975(93)90116-B_BIB20","series-title":"Recursive Function Theory and Logic","author":"Yasuhara","year":"1971"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390116B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390116B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:23:34Z","timestamp":1555129414000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390116B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["030439759390116B"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90116-b","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}