Publications





Surveys
  1. Concatenation hierarchies: New bottle, old wine.
    In CSR'17.
    Joint work with M. Zeitoun

  2. The Tale of the Quantifier Alternation Hierarchy of First-Order Logic over Words.
    In SIGLOG news 2 (3), ACM. July 2015
    Joint work with M. Zeitoun

Conferences
  1. Separating without any ambiguity.
    In ICALP'18.
    Joint work with M. Zeitoun

  2. Separation for dot-depth two.
    In LICS'17.
    Joint work with M. Zeitoun

  3. The Covering Problem: a Unified Approach for Investigating the Expressive Power of Logics.
    In MFCS'16.
    Joint work with M. Zeitoun

  4. Quantifier Alternation for Infinite Words.
    In FOSSACS'16.
    Joint work with T. Pierron and M. Zeitoun

  5. Separating Regular Languages with Two Quantifier Alternations.
    In LICS'15.

  6. Separation and the Successor Relation.
    In STACS'15.
    Joint work with M. Zeitoun

  7. Separating Regular Languages with First-Order Logic.
    In CSL-LICS'14.
    Joint work with M. Zeitoun

  8. Going higher in the First-order Quantifier Alternation Hierarchy on Words.
    In ICALP'14.
    Joint work with M. Zeitoun

  9. Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages.
    In FSTTCS'13.
    Joint work with L. V. Rooijen and M. Zeitoun

  10. Separating Regular Languages by Piecewise and Unambiguous Languages.
    In MFCS'13.
    Joint work with L. V. Rooijen and M. Zeitoun

  11. Towards Model Theory with Data Values.
    In ICALP'12.
    Joint work with M. Bojańczyk

  12. Regular Languages of Infinite Trees that are Boolean Combination of Open Sets.
    In ICALP'12.
    Joint work with M. Bojańczyk

  13. Classes of trees definable in the μ-calculus.
    In MFCS'10.
    Joint work with G. Fontaine

  14. Deciding definability in FO2(<) (or XPath) on trees.
    In LICS'10.
    Joint work with L. Segoufin.

  15. A decidable characterization of Locally Testable Tree Languages.
    In ICALP'09.
    Joint work with L. Segoufin.

  16. Characterization of Logics Over Ranked Tree Languages.
    In CSL'08.



Journals
  1. The Covering Problem.
    In Logical Methods in Computer Science (LMCS) Volume 13 Issue 3 2018
    Joint work with M. Zeitoun.

  2. Generic Results for Concatenation Hierarchies.
    In Theory of Computing Systems 2018
    Joint work with M. Zeitoun.

  3. Separating Regular Languages with First-Order Logic.
    In Logical Methods in Computer Science (LMCS) Volume 12 Issue 1 2016
    Joint work with M. Zeitoun.

  4. Deciding definability in FO2(<h,<v) on trees.
    In Logical Methods in Computer Science (LMCS) Volume 11 Issue 3 2015
    Joint work with L. Segoufin.

  5. On Separation by Locally Testable and Locally Threshold Testable Languages.
    In Logical Methods in Computer Science (LMCS) Volume 10 Issue 3 2014
    Joint work with L. V. Rooijen and M. Zeitoun.

  6. A decidable characterization of Locally Testable Tree Languages.
    In Logical Methods in Computer Science (LMCS) Volume 7 Issue 4 2011
    Joint work with L. Segoufin.