{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:33Z","timestamp":1725516213405},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_10","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"142-156","source":"Crossref","is-referenced-by-count":1,"title":["Combining Equational Tree Automata over AC and ACI Theories"],"prefix":"10.1007","author":[{"given":"Joe","family":"Hendrix","sequence":"first","affiliation":[]},{"given":"Hitoshi","family":"Ohsaki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), \n                  \n                    http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0890-5401(03)00134-2","volume":"187","author":"H. Comon","year":"2003","unstructured":"Comon, H., Jacquemard, F.: Ground reducibility is EXPTIME-complete. Information and Computation\u00a0187(1), 123\u2013153 (2003)","journal-title":"Information and Computation"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BFb0017430","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"P. Devienne","year":"1997","unstructured":"Devienne, P., Talbot, J.-M., Tison, S.: Solving classes of set constraints with tree automata. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 62\u201376. Springer, Heidelberg (1997)"},{"issue":"3\u20134","key":"10_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10817-004-6246-0","volume":"33","author":"G. Feuillade","year":"2004","unstructured":"Feuillade, G., Genet, T., Viet Triem Tong, V.: Reachability analysis over term rewriting systems. J. Autom. Reasoning\u00a033(3\u20134), 341\u2013383 (2004)","journal-title":"J. Autom. Reasoning"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/10721959_21","volume-title":"Automated Deduction - CADE-17","author":"T. Genet","year":"2000","unstructured":"Genet, T., Klay, F.: Rewriting for cryptographic protocol verification. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 271\u2013290. Springer, Heidelberg (2000)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-73449-9_18","volume-title":"Term Rewriting and Applications","author":"J. Hendrix","year":"2007","unstructured":"Hendrix, J., Meseguer, J.: On the completeness of context-sensitive order-sorted specifications. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 229\u2013245. Springer, Heidelberg (2007)"},{"key":"10_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/11814771_14","volume-title":"Automated Reasoning","author":"J. Hendrix","year":"2006","unstructured":"Hendrix, J., Meseguer, J., Ohsaki, H.: A sufficient completeness checker for linear order-sorted specifications modulo axioms. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 151\u2013155. Springer, Heidelberg (2006)"},{"key":"10_CR8","unstructured":"Hendrix, J., Ohsaki, H.: Combining equational tree automata over AC and ACI theories. Technical Report UIUCDCS-R-2008-2940, University of Illinois (2008)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11805618_5","volume-title":"Term Rewriting and Applications","author":"J. Hendrix","year":"2006","unstructured":"Hendrix, J., Ohsaki, H., Viswanathan, M.: Propositional tree automata. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 50\u201365. Springer, Heidelberg (2006)"},{"key":"10_CR10","first-page":"394","volume-title":"Proc. of LICS 1999","author":"M.W. Hopkins","year":"1999","unstructured":"Hopkins, M.W., Kozen, D.: Parikh\u2019s theorem in commutative kleene algebra. In: Proc. of LICS 1999, pp. 394\u2013401. IEEE Computer Society, Los Alamitos (1999)"},{"key":"10_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)"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF01893885","volume":"28","author":"D. Kapur","year":"1991","unstructured":"Kapur, D., Narendran, P., Rosenkrantz, D., Zhang, H.: Sufficient-completeness, ground-reducibility and their complexity. Acta Inf.\u00a028(4), 311\u2013350 (1991)","journal-title":"Acta Inf."},{"key":"10_CR13","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA Version 1.4 User Manual. BRICS, Department of Computer Science, University of Aarhus, Notes Series NS-01-1. Revision of BRICS NS-98-3 (January 2001), \n                  \n                    http:\/\/www.brics.dk\/mona\/"},{"issue":"1\u20132","key":"10_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.tcs.2004.10.023","volume":"333","author":"D. Lugiez","year":"2005","unstructured":"Lugiez, D.: Multitree automata that count. Theoretical Comput. Sci.\u00a0333(1\u20132), 225\u2013263 (2005)","journal-title":"Theoretical Comput. Sci."},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst.\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-44802-0_38","volume-title":"Computer Science Logic","author":"H. Ohsaki","year":"2001","unstructured":"Ohsaki, H.: Beyond regularity: Equational tree automata for associative and commutative theories. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 539\u2013553. Springer, Heidelberg (2001)"},{"key":"10_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-74621-8_15","volume-title":"Frontiers of Combining Systems","author":"H. Ohsaki","year":"2007","unstructured":"Ohsaki, H., Seki, H.: Languages modulo normalization. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol.\u00a04720, pp. 221\u2013236. Springer, Heidelberg (2007)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45610-4_9","volume-title":"Rewriting Techniques and Applications","author":"H. Ohsaki","year":"2002","unstructured":"Ohsaki, H., Takai, T.: Decidability and closure properties of equational tree languages. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 114\u2013128. Springer, Heidelberg (2002)"},{"key":"10_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/11591191_24","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"H. Ohsaki","year":"2005","unstructured":"Ohsaki, H., Talbot, J.-M., Tison, S., Roos, Y.: Monotone AC-tree automata. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 337\u2013351. Springer, Heidelberg (2005)"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2422.322411","volume":"31","author":"R.E. Shostak","year":"1984","unstructured":"Shostak, R.E.: Deciding combinations of theories. J. ACM\u00a031(1), 1\u201312 (1984)","journal-title":"J. ACM"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(85)90077-5","volume":"41","author":"G. Slutzki","year":"1985","unstructured":"Slutzki, G.: Alternating tree automata. Theoretical Comput. Sci.\u00a041, 305\u2013318 (1985)","journal-title":"Theoretical Comput. Sci."},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-540-39813-4_12","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K.N. Verma","year":"2003","unstructured":"Verma, K.N.: On closure under complementation of equational tree automata for theories extending AC. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 183\u2013197. Springer, Heidelberg (2003)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-44881-0_14","volume-title":"Rewriting Techniques and Applications","author":"K.N. Verma","year":"2003","unstructured":"Verma, K.N.: Two-way equational tree automata for AC-like theories: Decidability and closure properties. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 180\u2013196. Springer, Heidelberg (2003)"},{"issue":"6","key":"10_CR25","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.ic.2006.12.006","volume":"205","author":"K.N. Verma","year":"2007","unstructured":"Verma, K.N., Goubault-Larrecq, J.: Alternating two-way AC-tree automata. Information and Computation\u00a0205(6), 817\u2013869 (2007)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:23:51Z","timestamp":1620015831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}