{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:32Z","timestamp":1759638032386},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_12","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T23:37:34Z","timestamp":1294443454000},"page":"134-145","source":"Crossref","is-referenced-by-count":41,"title":["Locating Matches of Tree Patterns in Forests"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Neumann","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Automata Implementation","author":"M. Biehl","year":"1997","unstructured":"Biehl, M., Klarlund, N., Rauhe, T.: Algorithms for guided tree automata. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol.\u00a01260, Springer, Heidelberg (1997)"},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/117009.117013","volume":"13","author":"J. B\u00f6rstler","year":"1991","unstructured":"B\u00f6rstler, J., M\u00f6ncke, U., Wilhelm, R.: Table Compression for Tree Automata. ACM TOPLAS\u00a013(3), 295\u2013314 (1991)","journal-title":"ACM TOPLAS"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"W.S. Brainerd","year":"1969","unstructured":"Brainerd, W.S.: Tree Generating Regular Systems. Information and Control\u00a014, 217\u2013231 (1969)","journal-title":"Information and Control"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BFb0053565","volume-title":"Programming Languages and Systems","author":"C. Fecht","year":"1998","unstructured":"Fecht, C., Seidl, H.: Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol.\u00a01381, pp. 90\u2013104. Springer, Heidelberg (1998)"},{"key":"12_CR6","volume-title":"The SGML Handbook","author":"C.F. Goldfarb","year":"1990","unstructured":"Goldfarb, C.F.: The SGML Handbook. Clarendon Press, Oxford (1990)"},{"key":"12_CR7","unstructured":"LeCharlier, B., Van Hentenryck, P.: A Universal Top-Down Fixpoint Algorithm. Technical Report CS-92-25, Brown University, Providence (1992)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0020-0190(94)00022-0","volume":"50","author":"E. Moriya","year":"1994","unstructured":"Moriya, E.: On two-way tree automata. IPL\u00a050, 117\u2013121 (1994)","journal-title":"IPL"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-63620-X_61","volume-title":"Principles of Document Processing","author":"M. Murata","year":"1997","unstructured":"Murata, M.: Transformations of Trees and Schemas by Patterns and Contextual Conditions. In: Nicholas, C., Wood, D. (eds.) PODDP 1996 and PODP 1996. LNCS, vol.\u00a01293, pp. 153\u2013169. Springer, Heidelberg (1997)"},{"key":"12_CR10","volume-title":"Compiler Design","author":"D. Maurer","year":"1995","unstructured":"Maurer, D., Wilhelm, R.: Compiler Design. Addison-Wesley, Reading (1995)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Neumann, A., Seidl, H.: Locating Matches of Tree Patterns in Forests. Technical Report 98-08, Mathematik\/Informatik, Universit\u00e4t Trier (1998)","DOI":"10.1007\/978-3-540-49382-2_12"},{"key":"12_CR12","first-page":"41","volume-title":"Tree Automata and Languages","author":"A. Podelski","year":"1992","unstructured":"Podelski, A.: A Monoid Approach to Tree Automata. In: Nivat, M., Podelski, A. (eds.) Tree Automata and Languages, pp. 41\u201356. North Holland, Amsterdam (1992)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0019-9958(68)90999-6","volume":"13","author":"C. Pair","year":"1968","unstructured":"Pair, C., Quere, A.: D\u00e9finition et Etude des Bilangages R\u00e9guliers. Information and Control\u00a013, 565\u2013593 (1968)","journal-title":"Information and Control"},{"key":"12_CR14","unstructured":"Shankar, P., Gantait, A., Yuvaraj, A.R., Madhavan, M.: A New Algorithm for Linear Regular Tree Pattern Matching. Submitted to TCS (1998)"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(75)90058-3","volume":"27","author":"M. Takahashi","year":"1975","unstructured":"Takahashi, M.: Generalizations of Regular Sets and their Application to a Study of Context-Free Languages. Information and Control\u00a027, 1\u201336 (1975)","journal-title":"Information and Control"},{"key":"12_CR16","first-page":"317","volume":"1","author":"J.W. Thatcher","year":"1967","unstructured":"Thatcher, J.W.: Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory. JCSS\u00a01, 317\u2013322 (1967)","journal-title":"JCSS"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:06:56Z","timestamp":1559916416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49382-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653844","9783540493822"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49382-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}