{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:09:53Z","timestamp":1725574193364},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653844"},{"type":"electronic","value":"9783540493822"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-540-49382-2_11","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T23:37:34Z","timestamp":1294443454000},"page":"122-133","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Regular Tree Pattern Matching Using Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Maya","family":"Madhavan","sequence":"first","affiliation":[]},{"given":"Priti","family":"Shankar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Ganapathi, M.: Efficient tree pattern matching: an aid to code generation. In: Proc. 12th ACM Symp. on Priciples of Programming Languages, pp. 334\u2013340 (1985)","DOI":"10.1145\/318593.318663"},{"issue":"15","key":"11_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0096-0551(90)90006-B","volume":"3","author":"A. Balachandran","year":"1990","unstructured":"Balachandran, A., Dhamdhere, D.M., Biswas, S.: Efficient retargetable code generation using bottom up tree pattern matching. Comput. Lang.\u00a03(15), 127\u2013140 (1990)","journal-title":"Comput. Lang."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Chase, D.: An improvement to bottom up tree pattern matching. In: Proc. 14th Ann. ACM Symp. on Principles of Programming Languages, pp. 168\u2013177 (1987)","DOI":"10.1145\/41625.41640"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/BF01178733","volume":"31","author":"C. Ferdinand","year":"1994","unstructured":"Ferdinand, C., Seidl, H., Wilhelm, R.: Tree Automata for Code Selection. Acta Informatica\u00a031, 741\u2013760 (1994)","journal-title":"Acta Informatica"},{"key":"11_CR5","unstructured":"Gantait, A.: Design of a bottom up tree pattern matching algorithm and its application to code generation, ME Project Report, Department Of Computer Science and Automation, Indian Institute of Science, Bangalore (1996)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Glanville, R.S., Graham, S.L.: A new approach to compiler code generation. In: Proc. 5th ACM Symposium on Principles of Programming Languages, pp. 231\u2013240 (1978)","DOI":"10.1145\/512760.512785"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Hatcher, P., Christopher, T.: High-qualityc ode generation via bottom-up tree pattern matching. In: Proc. 13th ACM Symp. on Principles of Programming Languages, pp. 119\u2013130 (1986)","DOI":"10.1145\/512644.512655"},{"key":"11_CR8","unstructured":"Henry, R.R.: Encoding optimal pattern selection in a table-driven bottom-up tree pattern matcher, Technical Report 89-02-04, Computer Science Department, University of Washington (1989)"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C. Hoffmann","year":"1982","unstructured":"Hoffmann, C., O\u2019Donnell, M.J.: Pattern matching in trees. J. ACM\u00a029(1), 68\u201395 (1982)","journal-title":"J. ACM"},{"key":"11_CR10","volume-title":"An Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: An Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Madhavan, M.: Optimal linear regular tree pattern matching using pushdown automata, MSc (Engineering) Thesis(submitted), Department of Computer Science and Automation, Indian Institute of Science, Bangalore (1998)","DOI":"10.1007\/978-3-540-49382-2_11"},{"key":"11_CR12","unstructured":"Madhavan, M., Shankar, P.: Finding minimal cost derivation trees for regular tree grammars, Technical report IISC-CSA-98-07, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India (August 1998)"},{"issue":"8","key":"11_CR13","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s002360050099","volume":"34","author":"A. Nymeyer","year":"1997","unstructured":"Nymeyer, A., Katoen, J.P.: Code generation based on formal BURS theory and heuristic search. Acta Informatica\u00a034(8), 597\u2013636 (1997)","journal-title":"Acta Informatica"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Pelegri-Llopart, E., Graham, S.L.: Optimal code generation for expression trees: An application of BURS theory. In: Proc. 15th ACM Symposium on Principles of Programming Languages, pp. 119\u2013129 (1988)","DOI":"10.1145\/73560.73586"},{"issue":"17","key":"11_CR15","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/203095.203098","volume":"3","author":"T.A. Proebsting","year":"1995","unstructured":"Proebsting, T.A.: BURS automata generation. ACM Trans. on Prog. Lang. and Sys.\u00a03(17), 461\u2013486 (1995)","journal-title":"ACM Trans. on Prog. Lang. and Sys."},{"key":"11_CR16","unstructured":"Ravi Kumar, S.: Retargettable code generation using bottom up tree pattern matching, M.E Project Report, Department of Computer Science and Automation, Indian Institute of Science, Bangalore (1992)"},{"key":"11_CR17","unstructured":"Shankar, P., Gantait, A., Yuvaraj, A.R., Madhavan, M.: A New algorithm for linear regular tree pattern matching. To appear in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49382-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:06:58Z","timestamp":1559916418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49382-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653844","9783540493822"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49382-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}