Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Camille Vacher"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 2 (2013)
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 e
Externí odkaz:
https://doaj.org/article/62e8b39888374559a6a263c671469703
Publikováno v:
Information and Computation
Information and Computation, Elsevier, 2011, 209 (3), pp.486-512. ⟨10.1016/j.ic.2010.11.015⟩
Information and Computation, 2011, 209 (3), pp.486-512. ⟨10.1016/j.ic.2010.11.015⟩
Information and Computation, Elsevier, 2011, 209 (3), pp.486-512. ⟨10.1016/j.ic.2010.11.015⟩
Information and Computation, 2011, 209 (3), pp.486-512. ⟨10.1016/j.ic.2010.11.015⟩
International audience; 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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85e0300a0a32f2ca622019fe86602399
https://doi.org/10.1016/j.ic.2010.11.015
https://doi.org/10.1016/j.ic.2010.11.015
Publikováno v:
Logical Methods in Computer Science
Logical Methods in Computer Science, 2013, 9 (2), pp.1-39
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2013, 9 (2), pp.1-39
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Logical Methods in Computer Science, 2013, 9 (2), pp.1-39
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2013, 9 (2), pp.1-39
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
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 e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e212ab7d2a89f47acc204d3e4173750
http://arxiv.org/abs/1302.6960
http://arxiv.org/abs/1302.6960
Publikováno v:
Third International Conference on Language and Automata Theory and Applications
Third International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.446-457, ⟨10.1007/978-3-642-00982-2_38⟩
Language and Automata Theory and Applications ISBN: 9783642009815
LATA
Third International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.446-457, ⟨10.1007/978-3-642-00982-2_38⟩
Language and Automata Theory and Applications ISBN: 9783642009815
LATA
International audience; 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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f541ce2884df960411a4b779c2415c4d
https://hal.inria.fr/inria-00579001/file/RTA.pdf
https://hal.inria.fr/inria-00579001/file/RTA.pdf