{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:01:07Z","timestamp":1648749667814},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"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":4825,"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":[[2000,5]]},"DOI":"10.1016\/s0304-3975(98)00207-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:38:29Z","timestamp":1027651109000},"page":"1-29","source":"Crossref","is-referenced-by-count":0,"title":["The tree equivalence of linear recursion schemes"],"prefix":"10.1016","volume":"238","author":[{"given":"V.","family":"Sabelfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00207-2_BIB1","unstructured":"J. deBakker, S. Dana, A theory of programs, unpublished report, August 1969."},{"key":"10.1016\/S0304-3975(98)00207-2_BIB2","doi-asserted-by":"crossref","unstructured":"C. Beeri, An improvement on Valiant's decision procedure for equivalence of deterministic finite-turn pushdown machines, Theoret. Comput. Sci. No (3) (1976) 305\u2013320.","DOI":"10.1016\/0304-3975(76)90049-9"},{"key":"10.1016\/S0304-3975(98)00207-2_BIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01768471","article-title":"On jump deterministic pushdown automata","volume":"11","author":"Courcelle","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(98)00207-2_BIB4","doi-asserted-by":"crossref","unstructured":"B. Courcelle, A representation of trees by languages, Theoret. Comput. Sci. 6 (1978) 225\u2013279; 7, 25\u201355.","DOI":"10.1016\/0304-3975(78)90008-7"},{"issue":"4","key":"10.1016\/S0304-3975(98)00207-2_BIB5","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","article-title":"Variations on the common subexpression problem","volume":"27","author":"Downey","year":"1980","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0304-3975(98)00207-2_BIB6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(81)90055-4","article-title":"DPDA's in \u2018Atomic normal form\u2019 and applications to equivalence problems","volume":"14","author":"Gallier","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00207-2_BIB7","unstructured":"S.J. Garland, D.C. Luckham, Program schemes, recursion schemes and formal languages, Report UCLA-ENG-7154, School of Engineering and Applied Science, University of California, Los Angeles, June 1971."},{"issue":"3","key":"10.1016\/S0304-3975(98)00207-2_BIB8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","article-title":"Monotone data flow analysis frameworks","volume":"7","author":"Kam","year":"1977","journal-title":"Acta Informatica."},{"key":"10.1016\/S0304-3975(98)00207-2_BIB9","first-page":"358","article-title":"Program equivalence and context-free grammars","volume":"11","author":"Rosen","year":"1975","journal-title":"JCSS"},{"issue":"4","key":"10.1016\/S0304-3975(98)00207-2_BIB10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(81)90046-6","article-title":"Tree equivalence of linear recursive schemata is polynomial-time decidable","volume":"13","author":"Sabelfeld","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00207-2_BIB11","unstructured":"V.K. Sabelfeld, Equivalent transformations of recursion schemes and admissible rewriting rules, Novosibirsk, 1993, 20pp., Prepr.\/ISI SD RAS; No 20."},{"key":"10.1016\/S0304-3975(98)00207-2_BIB12","unstructured":"L.G. Valiant, Decision procedures for families of deterministic pushdown automata, Ph. D. Thesis, University of Warwick, UK, 1973."},{"key":"10.1016\/S0304-3975(98)00207-2_BIB13","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, The equivalence problem for deterministic finite-turn pushdown machines, Inform. Control (5) (1975) 123\u2013133.","DOI":"10.1016\/S0019-9958(74)90839-0"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002072?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002072?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:08:58Z","timestamp":1580875738000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397598002072"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00207-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}