Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Tree automata with constraints and tree homomorphisms

Autor
Creus, C.
Tipus d'activitat
Tesi doctoral
Altres unitats relacionades
Departament de Ciències de la Computació
Data de la defensa
2016-05-24
URL
http://hdl.handle.net/10803/394077 Obrir en finestra nova
Resum
Automata are a widely used formalism in computer science as a concise representation for sets. They are interesting from a theoretical and practical point of view. This work is focused on automata that are executed on tree-like structures, and thus, define sets of trees. Moreover, we tackle automata that are enhanced with the possibility to check (dis)equality constraints, i.e., where the automata are able to test whether specific subtrees of the input tree are equal or different. Two distinct m...
Format
137 p.
application/pdf
Identificador
http://hdl.handle.net/10803/394077
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius