#### Filter Results:

#### Publication Year

2009

2012

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can test for equality and disequality between sub-terms whose positions are defined by the states reached during a computation. In particular, TAGC can check that all the subterms… (More)

We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a restriction on the computation of RTA on trees: two subtrees reaching the same rigid state in a run must be equal. RTA are able to perform local and global tests of equality between… (More)

We introduce the class of rigid tree automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a restriction on the computation of RTA on trees: RTA can test for equality in subtrees reaching the same rigid state. RTA are able to perform local and global tests of equality between… (More)

We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007). TABG can test for equality and disequality modulo a given flat equational theory between brother subterms and between subterms… (More)

- Camille Vacher
- 2010

- ‹
- 1
- ›