{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:14:39Z","timestamp":1761610479377,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80335-4","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"132-143","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Dynamic Deterministic Pattern-Matching"],"prefix":"10.1016","volume":"31","author":[{"given":"Nadia","family":"Nedjah","sequence":"first","affiliation":[]},{"given":"Luiza","family":"de Macedo Mourelle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80335-4_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient String Matching: and Aid to Bibliographic Search","author":"Aho","year":"1975","journal-title":"Communications of ACM, 18, 6"},{"key":"10.1016\/S1571-0661(05)80335-4_BIB2","first-page":"218","article-title":"A Compiler for Lazy ML","author":"Augustsson","year":"1984","journal-title":"Proc. ACM Conference on Lisp and Functional Programming, ACM"},{"key":"10.1016\/S1571-0661(05)80335-4_BIB3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00881866","article-title":"Flatterms, Discrimination Nets and Fast Term Rewriting","volume":"Vol. 10","author":"Christian","year":"1993","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(05)80335-4_BIB4","series-title":"International Computer Science Series","article-title":"Functional Programming","author":"Field","year":"1988"},{"key":"10.1016\/S1571-0661(05)80335-4_BIB5","first-page":"323","article-title":"Left-to-Right Tree Pattern-Matching","volume":"vol. 488","author":"Gr\u00e4f","year":"1991","journal-title":"Proc. Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science"},{"issue":"n 1","key":"10.1016\/S1571-0661(05)80335-4_BIB6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","article-title":"Pattern-Matching in Trees","volume":"vol. 29","author":"Hoffman","year":"1982","journal-title":"Journal of ACM"},{"key":"10.1016\/S1571-0661(05)80335-4_BIB7","series-title":"Proc. Conference on Computational Problems in Abstract Algebra, Oxford","first-page":"263","article-title":"Simple World Problems in Universal Algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/S1571-0661(05)80335-4_BIB8","article-title":"Optimal Left-to-Right Pattern-Matching Automata","volume":"Vol. 1298","author":"Nedjah","year":"1997"},{"key":"10.1016\/S1571-0661(05)80335-4_BIB9","series-title":"Ph. D. Thesis, University of Manchester Institute of Science and Technology","article-title":"Pattern-matching Automata for Effcient Evaluation of Equational Programs","author":"Nedjah","year":"1997"},{"issue":"no. 6","key":"10.1016\/S1571-0661(05)80335-4_BIB10","article-title":"Very Efficient Pattern-Matching for Overlapping Patterns","volume":"vol. 6","author":"Nedjah","year":"1998","journal-title":"Proc. WoLLIC98, S\u00e3o Paulo, Brazil (abstract appears in Journal of IGPL)"},{"issue":"no. 9","key":"10.1016\/S1571-0661(05)80335-4_BIB11","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1002\/(SICI)1097-024X(19990725)29:9<793::AID-SPE254>3.0.CO;2-M","article-title":"Efficient Automata-Driven Left-to-Right Pattern-Matching for Equational Programs","volume":"vol. 29","author":"Nedjah","year":"1999","journal-title":"Software-Practice and Experience"},{"year":"1985","series-title":"Equational Logic as Programming Language","author":"O'","key":"10.1016\/S1571-0661(05)80335-4_BIB12"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803354?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803354?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:03Z","timestamp":1761610083000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":12,"alternative-id":["S1571066105803354"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80335-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dynamic Deterministic Pattern-Matching","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80335-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}