{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:57Z","timestamp":1760202537682},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73208-2_33","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"346-360","source":"Crossref","is-referenced-by-count":2,"title":["Finite Automata on Unranked and Unordered DAGs"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Priese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ipl.2005.02.004","volume":"94","author":"S. Anantharaman","year":"2005","unstructured":"Anantharaman, S., Narendran, P., Rusinowitch, M.: Closure properties and decision problems of dag automata. Information Processing Letters\u00a094, 231\u2013240 (2005)","journal-title":"Information Processing Letters"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1007\/978-3-540-32033-3_36","volume-title":"Term Rewriting and Applications","author":"I. Boneva","year":"2005","unstructured":"Boneva, I., Talbot, J.-M.: Automata and logic for unranked and unordered trees. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 500\u2013515. Springer, Heidelberg (2005)"},{"key":"33_CR3","first-page":"251","volume":"117","author":"F. Bossut","year":"1995","unstructured":"Bossut, F., Dauchet, M., Warin, B.: A Kleene theorem for a class of planar acyclic graphs. Theor. Comp. Science Center Report HKUST-TCSC 2001-5\u00a0117, 251\u2013265 (1995)","journal-title":"Theor. Comp. Science Center Report HKUST-TCSC 2001-5"},{"key":"33_CR4","first-page":"29","volume":"5","author":"A. Br\u00fcggemann-Klein","year":"2001","unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular tree and hedge languages of unranked alphabets. Theor. Comp. Science Center Report HKUST-TCSC 2001\u00a05, 29 (2001)","journal-title":"Theor. Comp. Science Center Report HKUST-TCSC 2001"},{"unstructured":"Charatonik, W.: Automata on dag representations of finite trees. Technical Report MPI-I-1999-2-001, MPI, Univ. Saarbr\u00fccken (1999)","key":"33_CR5"},{"unstructured":"Comon, H., Daucher, M., Gilleron, R., Tison, S., Tommasi, M.: Tree automata techniques and application. Available on the Web from 13ux02.univ-lille.fr in directoty tata (1998)","key":"33_CR6"},{"key":"33_CR7","first-page":"112","volume-title":"Proc. 3rd Internat. Workshop on Graph-Grammars","author":"B. Courcelle","year":"1988","unstructured":"Courcelle, B.: A representation of graphs by algebraic expressions and its use for graph rewriting systems. In: Proc. 3rd Internat. Workshop on Graph-Grammars, pp. 112\u2013132. Springer, Heidelberg (1988)"},{"key":"33_CR8","first-page":"93","volume-title":"Resolution of Equations in Algebraic Structures","author":"B. Courcelle","year":"1989","unstructured":"Courcelle, B.: On recognizable sets and tree automata. In: A\u00eft-Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures, vol.\u00a01, pp. 93\u2013126. Academic Press, London (1989)"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45694-5_27","volume-title":"CONCUR 2002 - Concurrency Theory","author":"J. Fanchon","year":"2002","unstructured":"Fanchon, J., Morin, R.: Regular sets of pomsets with auitoconcurrency. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 402\u2013417. Springer, Heidelberg (2002)"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/S0019-9958(81)90438-1","volume":"49","author":"T. Kamimura","year":"1981","unstructured":"Kamimura, T., Slutzki, G.: Parallel and two-way automata on directed ordered acyclic graphs. Inf. Control\u00a049, 10\u201351 (1981)","journal-title":"Inf. Control"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(92)90012-8","volume":"44","author":"M. Kaminski","year":"1992","unstructured":"Kaminski, M., Pinter, S.: Finite automata on directed graphs. J. Comp. Sys. Sci.\u00a044, 425\u2013446 (1992)","journal-title":"J. Comp. Sys. Sci."},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/11779148_32","volume-title":"Developments in Language Theory","author":"J.R. Menzel","year":"2006","unstructured":"Menzel, J.R., Priese, L., Schuth, M.: Some examples of semi-rational dag languages. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 351\u2013362. Springer Verlag, Heidelberg (2006)"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/11505877_34","volume-title":"Developments in Language Theory","author":"L. Priese","year":"2005","unstructured":"Priese, L.: Semi-rational sets of dags. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 385\u2013396. Springer Verlag, Heidelberg (2005)"},{"unstructured":"Thomas, W.: Finite-state recognizability of graph properties. In: Krob, D. (ed.) Theorie des Automates et Applications, l\u2019Universite de Rouen, France, vol.\u00a0172, pp. 147\u2013159 (1992)","key":"33_CR14"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BFb0030586","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Automata theory on trees and partial orders. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 20\u201334. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:34:29Z","timestamp":1558488869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}