Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Decidable classes of tree automata mixing local and global constraints modulo flat theories

Autor
Barguño, L.; Creus, C.; Godoy, G.; Jacquemard, F.; Vacher, C.
Tipus d'activitat
Article en revista
Revista
Logical methods in computer science
Data de publicació
2013-02
Volum
9
Número
2
Pàgina inicial
1
Pàgina final
39
DOI
10.2168/LMCS-9(2:01)2013
Repositori
http://hdl.handle.net/2117/20262 Obrir en finestra nova
Resum
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 whose positions are defined by the states reached during a computation. In particular, TABG can check that all the subterms reaching a given s...
Citació
Barguño, L. [et al.]. Decidable classes of tree automata mixing local and global constraints modulo flat theories. "Logical methods in computer science", Febrer 2013, vol. 9, núm. 2, p. 1-39.
Paraules clau
Automata Theory, Computability And Decidability, Equivalence Classes, Forestry, Xml
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

  • Barguño, Luis  (autor)
  • Creus Lopez, Carles  (autor)
  • Godoy Balil, Guillermo  (autor)
  • Jacquemard, Florent  (autor)
  • Vacher, Camile  (autor)

Arxius