On nondeterministic unranked tree automata with sibling constraints

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 4, Issue , 2009, Pages 311-322

  Loding, Christof ^a   Wong, Karianto ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EMPTINESS PROBLEM; NONDETERMINISTIC AUTOMATA; SUBTREES; UNIVERSALITY PROBLEM; UNRANKED TREES;

FORESTRY; SOFTWARE ENGINEERING;

AUTOMATA THEORY;

EID: 78449264806     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2009.2328     Document Type: Conference Paper

References (17)

1. Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In Proc. STACS 1992. LNCS 577. Springer (1992)
2. Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In Proc. LICS 2006. IEEE Computer Society (2006)
3. Caron, A.C., Comon, H., Coquidé, J.L., Dauchet, M., Jacquemard, F.: Pumping, cleaning and symbolic constraints solving. In Proc. ICALP 1994. LNCS 820. Springer (1994)
4. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Available on http://www.grappa.univ-lille3.fr/tata (2007) Released on 12 October 2007.
5. Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science 331 (2005)
6. Comon-Lundh, H., Jacquemard, F., Perrin, N.: Visibly tree automata with memory and constraints. Logical Methods in Computer Science 4 (2008)
7. Dal Zilio, S., Lugiez, D.: XML schema, tree logic and sheaves automata. In Proc. RTA 2003. LNCS 2706. Springer (2003)
8. Dauchet, M., Caron, A.C., Coquidé, J.L.: Automata for reduction properties solving. Journal of Symbolic Computation 20 (1995)
9. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American Journal of Mathematics 35 (1913)
10. Filiot, E., Talbot, J.M., Tison, S.: Tree automata with global constraints. In Proc. DLT 2008. LNCS 5257. Springer (2008)
11. Habermehl, P., Iosif, R., Vojnar, T.: Automata-based verification of programs with tree updates. In Proc. TACAS 2006. LNCS 3920. Springer (2006)
12. Karianto, W., Löding, C.: Unranked tree automata with sibling equalities and dise-qualities. In Proc. ICALP 2007. LNCS 4596. Springer (2007) Full version appeared as Technical Report AIB-2006-13, RWTH Aachen University.
13. Mongy-Steen, J.: Transformation de noyaux reconnaissables d'arbres. Forêts RATEG. PhD thesis, Université de Lille I (1981)
14. Neven, F.: Automata, logic, and XML. In Proc. CSL 2002. LNCS 2471. Springer (2002)
15. Schwentick, T.: Automata for XML - a survey. J. Comput. Syst. Sci. 73 (2007)
16. Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In Proc. CSL 2006. LNCS 4207. Springer (2006)
17. Seidl, H., Schwentick, T., Muscholl, A.: Counting in trees. In Logic and Automata: History and Perspectives. Amsterdam University Press (2008)