{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:34Z","timestamp":1725516214109},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_11","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"157-171","source":"Crossref","is-referenced-by-count":6,"title":["Closure of Hedge-Automata Languages by Hedge Rewriting"],"prefix":"10.1007","author":[{"given":"Florent","family":"Jacquemard","sequence":"first","affiliation":[]},{"given":"Michael","family":"Rusinowitch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-540-28644-8_3","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 35\u201348. Springer, Heidelberg (2004)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 403\u2013418. Springer, Heidelberg (2000)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/978-3-540-32033-3_35","volume-title":"Term Rewriting and Applications","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., Touili, T.: On computing reachability sets of process rewrite systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 484\u2013499. Springer, Heidelberg (2005)"},{"key":"11_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (Last release October 12, 2007), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"11_CR5","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":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-73449-9_10","volume-title":"Term Rewriting and Applications","author":"I. Durand","year":"2007","unstructured":"Durand, I., S\u00e9nizergues, G.: Bottom-up rewriting is inverse recognizability preserving. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 107\u2013121. Springer, Heidelberg (2007)"},{"issue":"1\/2","key":"11_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"R. Gilleron","year":"1995","unstructured":"Gilleron, R., Tison, S.: Regular tree languages and rewrite systems. Fundamenta Informaticae\u00a024(1\/2), 157\u2013176 (1995)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.tcs.2004.04.009","volume":"327","author":"D. Hofbauer","year":"2004","unstructured":"Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. Theor. Comput. Sci.\u00a0327(3), 301\u2013317 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Rewriting Techniques and Applications","author":"F. Jacquemard","year":"1996","unstructured":"Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol.\u00a01103, pp. 362\u2013376. Springer, Heidelberg (1996)"},{"key":"11_CR10","unstructured":"Jacquemard, F., Rusinowitch, M.: Rewrite closure of hedge-automata languages. Research Report LSV-08-05, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France (2007), http:\/\/www.lsv.ens-cachan.fr\/Publis"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-74456-6_8","volume-title":"Mathematical Foundations of Computer Science 2007","author":"C. L\u00f6ding","year":"2007","unstructured":"L\u00f6ding, C., Spelten, A.: Transition graphs of rewriting systems over unranked trees. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 67\u201377. Springer, Heidelberg (2007)"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.tcs.2004.10.035","volume":"336","author":"W. Martens","year":"2005","unstructured":"Martens, W., Neven, F.: On the complexity of typechecking top-down XML transformations. Theor. Comput. Sci.\u00a0336(1), 153\u2013180 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR13","unstructured":"Murata, M.: Hedge Automata: a Formal Model for XML Schemata (2000), http:\/\/www.horobi.com\/Projects\/RELAX\/Archive\/hedge_nice.html"},{"key":"11_CR14","unstructured":"Murata, M., Lee, D., Mani, M.: Taxonomy of xml schema languages using formal language theory. In: Extreme Markup Languages (2001)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-48685-2_22","volume-title":"Rewriting Techniques and Applications","author":"T. Nagaya","year":"1999","unstructured":"Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 256\u2013270. Springer, Heidelberg (1999)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44802-0_38","volume-title":"Computer Science Logic","author":"H. Ohsaki","year":"2001","unstructured":"Ohsaki, H.: Beyond the regularity: Equational tree automata for associative and commutative theories. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142. Springer, Heidelberg (2001)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-44881-0_34","volume-title":"Rewriting Techniques and Applications","author":"H. Ohsaki","year":"2003","unstructured":"Ohsaki, H., Seki, H., Takai, T.: Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 483\u2013498. Springer, Heidelberg (2003)"},{"key":"11_CR18","unstructured":"d\u2019Orso, J., Touili, T.: Regular hedge model checking. In: Proc. of the 4th IFIP Int. Conf. on Theoretical Computer Science (TCS 2006), IFIP (2006)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","volume":"37","author":"K. Salomaa","year":"1988","unstructured":"Salomaa, K.: Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. J. of Comp. and System Sci.\u00a037, 367\u2013394 (1988)","journal-title":"J. of Comp. and System Sci."},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-45610-4_8","volume-title":"Rewriting Techniques and Applications","author":"H. Seki","year":"2002","unstructured":"Seki, H., Takai, T., Fujinaka, Y., Kaji, Y.: Layered Transducing Term Rewriting System and Its Recognizability Preserving Property. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 98\u2013113. Springer, Heidelberg (2002)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications","author":"T. Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 246\u2013260. Springer, Heidelberg (2000)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Touili, T.: Computing transitive closures of hedge transformations. In: Proc. 1st Int. Workshop on Verification and Evaluation of Computer and Communication Systems (VECOS 2007). eWIC Series. British Computer Society (2007)","DOI":"10.14236\/ewic\/VECOS2007.7"}],"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_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:18Z","timestamp":1605762498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}