PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Boiret, Adrien"

Author of the publication

copydeleteadd this publication to your clipboard
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.

No persons found for author name Boiret, Adrien
add a person with the name Boiret, Adrien
 

Other publications of authors with the same name

Logics for unordered trees with data constraints., , , and . J. Comput. Syst. Sci., (2019)The "Hilbert Method" for Solving Transducer Equivalence Problems., , and . CoRR, (2018)Learning Top-Down Tree Transducers with Regular Domain Inspection., , and . ICGI, volume 57 of JMLR Workshop and Conference Proceedings, page 54-65. JMLR.org, (2016)Normalization and Learning of Transducers on Trees and Words. (Normalisation et Apprentissage de Transducteurs d'Arbres et de Mots).. Lille University of Science and Technology, France, (2016)Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method"., , and . FSTTCS, volume 122 of LIPIcs, page 48:1-48:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Deterministic Automata for Unordered Trees., , , and . GandALF, volume 161 of EPTCS, page 189-202. (2014)Equivalence of Symbolic Tree Transducers., , and . DLT, volume 10396 of Lecture Notes in Computer Science, page 109-121. Springer, (2017)Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time., and . DLT, volume 9840 of Lecture Notes in Computer Science, page 355-367. Springer, (2016)Logics for Unordered Trees with Data Constraints on Siblings., , , and . LATA, volume 8977 of Lecture Notes in Computer Science, page 175-187. Springer, (2015)Normal Form on Linear Tree-to-Word Transducers.. LATA, volume 9618 of Lecture Notes in Computer Science, page 439-451. Springer, (2016)