4 citations · 9 across the 5 of their papers we have counts for
4 papers · 1 filter
Active Learning of Sequential Transducers with Side Information about the Domain
Raphaël Berthon, Adrien Boiret, Guillermo A. Perez +1
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 ofte…
Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method"
Adrien Boiret, Radosław Piórkowski, Janusz Schmude
In the past decades, classical results from algebra, including Hilbert's Basis Theorem, had various applications in formal languages, including a proof of the Ehrenfeucht Conjectur…
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
Adrien Boiret, Raphaela Palenta
We show that the equivalence of deterministic linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not nece…
Deterministic Automata for Unordered Trees
Adrien Boiret, Vincent Hugot, Joachim Niehren +1
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concernin…