Mostra el registre d'ítem simple
Emptiness and finiteness for tree automata with global reflexive disequality constraints
dc.contributor.author | Creus López, Carles |
dc.contributor.author | Gascón Caro, Adrià |
dc.contributor.author | Godoy Balil, Guillem |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2014-04-23T14:55:34Z |
dc.date.created | 2013-12-01 |
dc.date.issued | 2013-12-01 |
dc.identifier.citation | Creus, C.; Gascon, A.; Godoy, G. Emptiness and finiteness for tree automata with global reflexive disequality constraints. "Journal of automated reasoning", 01 Desembre 2013, vol. 51, núm. 4, p. 371-400. |
dc.identifier.issn | 0168-7433 |
dc.identifier.uri | http://hdl.handle.net/2117/22680 |
dc.description.abstract | In recent years, several extensions of tree automata have been considered. Most of them are related with the capability of testing equality or disequality of certain subterms of the term evaluated by the automaton. In particular, tree automata with global constraints are able to test equality and disequality of subterms depending on the state to which they are evaluated. The emptiness problem is known decidable for this kind of automata, but with a non-elementary time complexity, and the finiteness problem remains unknown. In this paper, we consider the particular case of tree automata with global constraints when the constraint is a conjunction of disequalities between states, and the disequality predicate is forced to be reflexive. This restriction is significant in the context of XML definitions with monadic key constraints. We prove that emptiness and finiteness are decidable in triple exponential time for this kind of automata. © 2012 Springer Science+Business Media Dordrecht. |
dc.format.extent | 30 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Sistemes d'informació |
dc.subject.other | Decision problems |
dc.subject.other | Disequality constraints |
dc.subject.other | Global constraints |
dc.subject.other | Tree automata |
dc.title | Emptiness and finiteness for tree automata with global reflexive disequality constraints |
dc.type | Article |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.identifier.doi | 10.1007/s10817-012-9270-5 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://link.springer.com/article/10.1007%2Fs10817-012-9270-5 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 12967431 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Creus, C.; Gascon, A.; Godoy, G. |
local.citation.publicationName | Journal of automated reasoning |
local.citation.volume | 51 |
local.citation.number | 4 |
local.citation.startingPage | 371 |
local.citation.endingPage | 400 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [1.049]
-
Articles de revista [274]