Author of the publication

Logics for Unordered Trees with Data Constraints on Siblings.

, , , and . LATA, volume 8977 of Lecture Notes in Computer Science, page 175-187. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The emptiness problem for tree automata with at least one global disequality constraint is NP-hard., , and . Inf. Process. Lett., (2017)Logics for Unordered Trees with Data Constraints on Siblings., , , and . LATA, volume 8977 of Lecture Notes in Computer Science, page 175-187. Springer, (2015)From Linear Temporal Logic Properties to Rewrite Propositions., , and . IJCAR, volume 7364 of Lecture Notes in Computer Science, page 316-331. Springer, (2012)Loops and overloops for Tree-Walking Automata., , and . Theor. Comput. Sci., (2012)Logics for unordered trees with data constraints., , , and . J. Comput. Syst. Sci., (2019)The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard., , and . CoRR, (2014)SAT Solvers for Queries over Tree Automata with Constraints., , and . ICST Workshops, page 343-348. IEEE Computer Society, (2010)Loops and Overloops for Tree Walking Automata., , and . CIAA, volume 6807 of Lecture Notes in Computer Science, page 166-177. Springer, (2011)Deterministic Automata for Unordered Trees., , , and . GandALF, volume 161 of EPTCS, page 189-202. (2014)Tree automata, approximations, and constraints for verification : Tree (Not quite) regular model-checking. (Automates d'arbres, approximations et contraintes pour la vérification : Model-checking d'arbres (pas tout à fait) régulier).. University of Franche-Comté, Besançon, France, (2013)