Classes of tree homomorphisms with decidable preservation of regularity

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

Volumn 4962 LNCS, Issue , 2008, Pages 127-141

  Godoy, Guillem ^a   Maneth, Sebastian ^b   Tison, Sophie ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c UNIV LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); FOOD PRESERVATION; FOUNDATIONS; FUNCTIONS; LINGUISTICS; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES;

COMPUTATIONAL STRUCTURES; DOMAIN LANGUAGE; EUROPEAN; HEIDELBERG (CO); INTERNATIONAL (CO); NONLINEARITY (INCLUDING BIFURCATION THEORY); OPEN PROBLEMS; POLYNOMIAL-TIME; REGULAR CONSTRAINTS; REGULAR TREE LANGUAGES; ROOT NODES; SOFTWARE SCIENCE;

COMPUTABILITY AND DECIDABILITY;

EID: 47249126870     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_10     Document Type: Conference Paper

References (15)

1. Aho, A.V., Ullman, J.D.: Translations on a context-free grammar. Information and Control 19, 439-475 (1971)
2. Bogaert, B., Seynhaeve, F., Tison, S.: The recognizability problem for tree automata with comparison between brothers. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 150-164. Springer, Heidelberg (1999)
3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), http://www.grappa.univ-lille3.fr/tata
4. Comon, H., Delor, C.: Equational formulae with membership constraints. Inf. Comput. 112, 167-216 (1994)
5. Engelfriet, J.: Bottom-up and top-down tree transformations - A comparison. Math. Systems Theory 9, 198-231 (1975)
6. Fülöp, Z.: Undecidable properties of deterministic top-down tree transducers. Theoret. Comput. Sci. 134, 311-328 (1994)
7. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, ch. 1, Springer, Heidelberg (1997)
8. Hopcroft, J.W., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)
9. Hosoya, H.: Foundations of XML processing (2002), http://arbre.is.s.u- tokyo.ac.jp/∼hahosoya/xmlbook/xmlbook.pdf
10. Kucherov, G., Rusinowitch, M.: Patterns in words versus patterns in trees: A brief survey and new results. In: Ershov Memorial Conference, pp. 283-296 (1999)
11. Kucherov, G., Tajine, M.: Decidability of regularity and related properties of ground normal form languages. Inf. Comput. 118, 91-100 (1995)
12. Lassez, J.-L., Marriott, K.: Explicit representation of terms defined by counter examples. J. Autom. Reasoning 3, 301-317 (1987)
13. Martens, W., Neven, F.: On the complexity of typechecking top-down xml transformations. Theor. Comput. Sci. 336, 153-180 (2005)
14. Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of xml schema languages using formal language theory. ACM Trans. Internet Techn. 5(4), 660-704 (2005)
15. Suciu, D.: The XML typechecking problem. SIGMOD Record 31, 89-96 (2002)