{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:01:36Z","timestamp":1743091296510,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_39","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"478-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Projection for B\u00fcchi Tree Automata with Constraints Between Siblings"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Landwehr","sequence":"first","affiliation":[]},{"given":"Christof","family":"L\u00f6ding","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Bargu\u00f1\u00f3, L., Creus, C., Godoy, G., Jacquemard, F., Vacher, C.: The emptiness problem for tree automata with global constraints. In: LICS, pp. 263\u2013272 (2010)","DOI":"10.1109\/LICS.2010.28"},{"key":"39_CR2","unstructured":"Bogaert, B.: Automates d\u2019arbres avec test d\u2019\u00e9galit\u00e9. Ph.D. thesis, L\u2019Universit\u00e9des Sciences et Techniques de Lille Flandres-Arto (1990)"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: STACS, pp. 161\u2013171 (1992)","DOI":"10.1007\/3-540-55210-3_181"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Carayol, A., L\u00f6ding, C., Serre, O.: Automata on infinite trees with equality and disequality constraints between siblings. In: LICS, pp. 227\u2013236 (2016)","DOI":"10.1145\/2933575.2934504"},{"key":"39_CR5","unstructured":"Comon, H., et al.: Tree Automata Techniques and Applications. http:\/\/tata.gforge.inria.fr\/ . Accessed 12 Oct 2007"},{"issue":"4","key":"39_CR6","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S012905411000743X","volume":"21","author":"E Filiot","year":"2010","unstructured":"Filiot, E., Talbot, J., Tison, S.: Tree automata with global constraints. Int. J. Found. Comput. Sci. 21(4), 571\u2013596 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"39_CR7","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/2508028.2501600","volume":"60","author":"G Godoy","year":"2013","unstructured":"Godoy, G., Gim\u00e9nez, O.: The HOM problem is decidable. J. ACM 60(4), 23:1\u201323:44 (2013)","journal-title":"J. ACM"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Godoy, G., Gim\u00e9nez, O., Ramos, L., \u00c0lvarez, C.: The HOM problem is decidable. In: STOC, pp. 485\u2013494 (2010)","DOI":"10.1145\/1806689.1806757"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-78127-1_21","volume-title":"Pillars of Computer Science","author":"M Kaminski","year":"2008","unstructured":"Kaminski, M., Tan, T.: Tree automata over infinite alphabets. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 386\u2013423. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78127-1_21"},{"key":"39_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/3-540-45061-0_54","volume-title":"Automata, Languages and Programming","author":"F Klaedtke","year":"2003","unstructured":"Klaedtke, F., Rue\u00df, H.: Monadic second-order logics with cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 681\u2013696. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_54"},{"key":"39_CR11","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA Version 1.4 User Manual. BRICS (2001). http:\/\/www.brics.dk\/mona\/ . Revision of BRICS NS-98-3"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: FOCS, pp. 531\u2013542. IEEE Computer Society (2005)","DOI":"10.1109\/SFCS.2005.66"},{"key":"39_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-16761-7_77","volume-title":"Automata, Languages and Programming","author":"DE Muller","year":"1986","unstructured":"Muller, D.E., Saoudi, A., Schupp, P.E.: Alternating automata, the weak monadic theory of the tree, and its complexity. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 275\u2013283. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16761-7_77"},{"key":"39_CR14","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1\u201335 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Weakly definable relations and special automata. In: BarHillel, Y. (ed.) Mathematical Logic and Foundations of Set Theory, pp. 1\u201323 (1970)","DOI":"10.1016\/S0049-237X(08)71929-3"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of omega-automata. In: FOCS, pp. 319\u2013327 (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: ACM SIGACT-SIGMOD-SIGART, pp. 155\u2013166. ACM (2003)","DOI":"10.1145\/773153.773169"},{"issue":"1","key":"39_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"JW Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theory 2(1), 57\u201381 (1968)","journal-title":"Math. Syst. Theory"},{"key":"39_CR19","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 389\u2013455. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_7"},{"issue":"3","key":"39_CR20","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ipl.2014.11.005","volume":"115","author":"M Veanes","year":"2015","unstructured":"Veanes, M., Bj\u00f8rner, N.: Symbolic tree automata. Inf. Process. Lett. 115(3), 418\u2013424 (2015)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98654-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T17:27:41Z","timestamp":1571678861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}