On p/qrecognisable sets.
Preprint.
2020.
Takingandmerging games as rewrite games.
Joint work with Eric Duchêne and Aline Parreau and Michel Rigo.
In Discrete Mathematics & Theoretical Computer Science, vol. 22, n°4.
2020.
Updating Graph Databases with Cypher.
Joint work with Alastair Green and Paolo Guagliardo and Leonid Libkin and Tobias Lindaaker and Stefan Plantikow and Martin Schuster and Petra Selmer and Hannes Voigt.
In proceedings of VLDB, vol. 12, n°12.
2019.
An efficient algorithm to decide periodicity of brecognisable sets using LSDF convention.
In Logical Methods in Computer Science, vol. 15, n°3.
2019.
Logic characterisation of p/qrecognisable sets.
Preprint.
2018.
Formal Semantics of the Language Cypher.
Joint work with Nadime Francis and Alastair Green and Paolo Guagliardo and Leonid Libkin and Tobias Lindaaker and Stefan Plantikow and Mats Rydberg and Martin Schuster and Petra Selmer and Andrés Taylor.
Technical Report.
2018.
Cypher: An Evolving Query Language for Property Graphs.
Joint work with Nadime Francis and Alastair Green and Paolo Guagliardo and Leonid Libkin and Tobias Lindaaker and Stefan Plantikow and Mats Rydberg and Petra Selmer and Andrés Taylor.
In proceedings of SIGMOD.
2018.
On subtrees of the representation tree in rational base numeration systems.
Joint work with Shigeki Akiyama and Jacques Sakarovitch.
In Discrete Mathematics & Theoretical Computer Science, vol. 20, n°1.
2018.
An Efficient Algorithm to Decide Periodicity of bRecognisable Sets Using MSDF Convention.
Joint work with Bernard Boigelot and Isabelle Mainz and Michel Rigo.
In proceedings of ICALP, Leibniz International Proceedings in Informatics, vol. 80.
2017.
Trees and languages with periodic signature.
Joint work with Jacques Sakarovitch.
In Indagationes Mathematicae, vol. 28, n°1.
2017.
The signature of rational languages.
Joint work with Jacques Sakarovitch.
In Theoretical Computer Science, vol. 658, Part A.
2017.
Énumération et numération.
Ph.D. Thesis.
In French.
2016.
Trees and Languages with Periodic Signature.
Joint work with Jacques Sakarovitch.
In proceedings of LATIN, Lecture Notes in Computer Science, vol. 9644.
2016.
Surminimisation of Automata.
In proceedings of DLT, Lecture Notes in Computer Science, vol. 9168.
2015.
BreadthFirst Serialisation of Trees and Rational Languages.
Joint work with Jacques Sakarovitch.
In proceedings of DLT, Lecture Notes in Computer Science, vol. 8633.
2014.
Autosimilarity in Rational Base Number Systems.
Joint work with Shigeki Akiyama and Jacques Sakarovitch.
In proceedings of WORDS, Lecture Notes in Computer Science, vol. 8079.
2013.
On Sets of Numbers Rationally Represented in a Rational Base Number System.
Joint work with Jacques Sakarovitch.
In proceedings of CAI, Lecture Notes in Computer Science, vol. 8080.
2013.
Ultimate Periodicity of bRecognisable Sets: A Quasilinear Procedure.
Joint work with Jacques Sakarovitch.
In proceedings of DLT, Lecture Notes in Computer Science, vol. 7907.
2013.
