Closure of hedge-automata languages by hedge rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5117 LNCS, Issue , 2008, Pages 157-171

  Jacquemard, Florent ^a   Rusinowitch, Michael ^b  

^a INRIA   (France)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BIOLOGICAL MATERIALS; FENCES; FOOD PRESERVATION; HYDROXYLATION; LINGUISTICS; MODEL CHECKING; QUERY LANGUAGES; STANDARDS; TRANSLATION (LANGUAGES);

A-PRIORI; CONTEXT-FREE; IN TRANSITIONS; INTERNATIONAL CONFERENCES; NON-TRIVIAL; REACH ABILITY; REWRITE RULES; REWRITE SYSTEMS; REWRITING SYSTEMS; TERM REWRITING;

CONTEXT FREE LANGUAGES;

EID: 48949093984     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70590-1_11     Document Type: Conference Paper

References (22)

1. 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. 3170, pp. 35-48. Springer, Heidelberg (2004)
2. Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 403-418. Springer, Heidelberg (2000)
3. Bouajjani, A., Touili, T.: On computing reachability sets of process rewrite systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 484-499. Springer, Heidelberg (2005)
4. 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
5. Dal-Zilio, S., Lugiez, D.: XML schema, tree logic and sheaves automata. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 246-263. Springer, Heidelberg (2003)
6. Durand, I., Sénizergues, G.: Bottom-up rewriting is inverse recognizability preserving. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 107-121. Springer, Heidelberg (2007)
7. Gilleron, R., Tison, S.: Regular tree languages and rewrite systems. Fundamenta Informaticae 24(1/2), 157-176 (1995)
8. Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. Theor. Comput. Sci. 327(3), 301-317 (2004)
9. Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 362-376. Springer, Heidelberg (1996)
10. Jacquemard, F., Rusinowitch, M.: Rewrite closure of hedge-automata languages. Research Report LSV-08-05, Laboratoire Spécification et Vérification, ENS Cachan, France (2007), http://www.lsv.ens-cachan.fr/ Publis
11. Löding, C., Spelten, A.: Transition graphs of rewriting systems over unranked trees. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 67-77. Springer, Heidelberg (2007)
12. Martens, W., Neven, F.: On the complexity of typechecking top-down XML transformations. Theor. Comput. Sci. 336(1), 153-180 (2005)
13. Murata, M.: Hedge Automata: a Formal Model for XML Schemata (2000), http://www.horobi.com/Projects/RELAX/Archive/hedge_nice.html
14. Murata, M., Lee, D., Mani, M.: Taxonomy of xml schema languages using formal language theory. In: Extreme Markup Languages (2001)
15. Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 256-270. Springer, Heidelberg (1999)
16. Ohsaki, H.: Beyond the regularity: Equational tree automata for associative and commutative theories. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142. Springer, Heidelberg (2001)
17. 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. 2706, pp. 483-498. Springer, Heidelberg (2003)
18. d'Orso, J., Touili, T.: Regular hedge model checking. In: Proc. of the 4th IFIP Int. Conf. on Theoretical Computer Science (TCS 2006), IFIP (2006)
19. Salomaa, K.: Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. J. of Comp. and System Sci. 37, 367-394 (1988)
20. 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. 2378, pp. 98-113. Springer, Heidelberg (2002)
21. 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. 1833, pp. 246-260. Springer, Heidelberg (2000)
22. 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)