{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:00:49Z","timestamp":1759683649297},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_75","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"875-887","source":"Crossref","is-referenced-by-count":5,"title":["Unranked Tree Automata with Sibling Equalities and Disequalities"],"prefix":"10.1007","author":[{"given":"Wong","family":"Karianto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"L\u00f6ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"75_CR1","series-title":"Lecture Notes in Computer Science","first-page":"161","volume-title":"STACS 1992","author":"B. Bogaert","year":"1992","unstructured":"Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 161\u2013171. Springer, Heidelberg (1992)"},{"key":"75_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1142351.1142354","volume-title":"PODS 2006","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS 2006, pp. 10\u201319. ACM Press, New York (2006)"},{"key":"75_CR3","first-page":"7","volume-title":"LICS 2006","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS 2006, pp. 7\u201316. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"75_CR4","unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Research Report HKUST-TCSC-2001-05, HKUST Theoretical Computer Science Center (2001), available on \n                    \n                      http:\/\/hdl.handle.net\/1783.1\/738"},{"key":"75_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/B978-044482830-9\/50027-8","volume-title":"Handbook of Process Algebra","author":"O. Burkart","year":"2001","unstructured":"Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Handbook of Process Algebra, pp. 545\u2013623. Elsevier, Amsterdam (2001)"},{"key":"75_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/3-540-58201-0_88","volume-title":"Automata, Languages, and Programming","author":"A.C. Caron","year":"1994","unstructured":"Caron, A.C., Comon, H., Coquid\u00e9, J.L., Dauchet, M., Jacquemard, F.: Pumping, cleaning and symbolic constraints solving. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 436\u2013449. Springer, Heidelberg (1994)"},{"key":"75_CR7","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1997) Current release: October 1st, 2002 Available on \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"75_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-44881-0_18","volume-title":"Rewriting Techniques and Applications","author":"S. Dal Zilio","year":"2003","unstructured":"Dal Zilio, S., Lugiez, D.: XML schema, tree logic and sheaves automata. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 246\u2013263. Springer, Heidelberg (2003)"},{"key":"75_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1006\/jsco.1995.1048","volume":"20","author":"M. Dauchet","year":"1995","unstructured":"Dauchet, M., Caron, A.C., Coquid\u00e9, J.L.: Automata for reduction properties solving. Journal of Symbolic Computation\u00a020, 215\u2013233 (1995)","journal-title":"Journal of Symbolic Computation"},{"key":"75_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L.E. Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American Journal of Mathematics\u00a035, 413\u2013422 (1913)","journal-title":"American Journal of Mathematics"},{"key":"75_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/11814771_45","volume-title":"Automated Reasoning","author":"F. Jacquemard","year":"2006","unstructured":"Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 557\u2013571. Springer, Heidelberg (2006)"},{"key":"75_CR12","unstructured":"Karianto, W., L\u00f6ding, C.: Unranked tree automata with sibling equalities and disequalities. Technical Report AIB-2006-13, RWTH Aachen (2006)"},{"key":"75_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/11523468_4","volume-title":"Automata, Languages and Programming","author":"L. Libkin","year":"2005","unstructured":"Libkin, L.: Logics for unranked trees: An overview. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 35\u201350. Springer, Heidelberg (2005)"},{"key":"75_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-36576-1_21","volume-title":"Foundations of Software Science and Computational Structures","author":"D. Lugiez","year":"2003","unstructured":"Lugiez, D.: Counting and equality constraints for multitree automata. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol.\u00a02620, pp. 328\u2013342. Springer, Heidelberg (2003)"},{"key":"75_CR15","unstructured":"Mongy-Steen, J.: Transformation de noyaux reconnaissables d\u2019arbres. For\u00eats RATEG. PhD thesis, Universit\u00e9 de Lille I (1981)"},{"key":"75_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45793-3_2","volume-title":"Computer Science Logic","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 2\u201326. Springer, Heidelberg (2002)"},{"key":"75_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/773153.773169","volume-title":"PODS 2003","author":"H. Seidl","year":"2003","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: PODS 2003, pp. 155\u2013166. ACM Press, New York (2003)"},{"key":"75_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1007\/978-3-540-27836-8_94","volume-title":"Automata, Languages and Programming","author":"H. Seidl","year":"2004","unstructured":"Seidl, H., Schwentick, T., Muscholl, A., Habermehl, P.: Counting in trees for free. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1136\u20131149. Springer, Heidelberg (2004)"},{"key":"75_CR19","unstructured":"Tommasi, M.: Automates d\u2019arbres avec tests d\u2019\u00e9galit\u00e9 entre cousins germains. Technical report, M\u00e9moire de DEA, Universit\u00e9 de Lille I (1992)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:11:28Z","timestamp":1619518288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}