Skip to main content

7 Result(s)

within Adrien Boiret Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Privacy Operators for Semantic Graph Databases as Graph Rewriting

    Database sanitization allows to share and publish open (linked) data without jeopardizing privacy. During their sanitization, graph databases are transformed following graph transformations that are usually de...

    Adrien Boiret, Cédric Eichler… in New Trends in Database and Information Sys… (2022)

  2. No Access

    Chapter and Conference Paper

    Active Learning of Sequential Transducers with Side Information About the Domain

    Active learning is a setting in which a student queries a teacher, through membership and equivalence queries, in order to learn a language. Performance on these algorithms is often measured in the number of q...

    Raphaël Berthon, Adrien Boiret, Guillermo A. Pérez… in Developments in Language Theory (2021)

  3. No Access

    Chapter and Conference Paper

    Equivalence of Symbolic Tree Transducers

    Symbolic tree transducers are programs that transform data trees with an infinite signature. In this paper, we show that the equivalence problem of deterministic symbolic top-down tree transducers (DTop) can be r...

    Vincent Hugot, Adrien Boiret, Joachim Niehren in Developments in Language Theory (2017)

  4. No Access

    Chapter and Conference Paper

    Normal Form on Linear Tree-to-Word Transducers

    We study a subclass of tree-to-word transducers: linear tree-to-word transducers, that cannot use several copies of the input. We aim to study the equivalence problem on this class, by using minimization and n...

    Adrien Boiret in Language and Automata Theory and Applications (2016)

  5. No Access

    Chapter and Conference Paper

    Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time

    We show that the equivalence of linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not necessarily order-preserving and can be used to...

    Adrien Boiret, Raphaela Palenta in Developments in Language Theory (2016)

  6. No Access

    Chapter and Conference Paper

    Logics for Unordered Trees with Data Constraints on Siblings

    We study counting monadic second-order logics (CMso) for unordered data trees. Our objective is to enhance this logic with data constraints for comparing string data values attached to sibling edges of a data ...

    Adrien Boiret, Vincent Hugot… in Language and Automata Theory and Applicati… (2015)

  7. No Access

    Chapter and Conference Paper

    Learning Rational Functions

    Rational functions are transformations from words to words that can be defined by string transducers. Rational functions are also captured by deterministic string transducers with lookahead. We show for the fi...

    Adrien Boiret, Aurélien Lemay, Joachim Niehren in Developments in Language Theory (2012)