Victor Marsault
Victor Marsault
Post-Doc, Department of Mathematics, Université de Liège, Belgium
Adresse e-mail validée de opayq.com - Page d'accueil
Titre
Citée par
Citée par
Année
Cypher: An evolving query language for property graphs
N Francis, A Green, P Guagliardo, L Libkin, T Lindaaker, V Marsault, ...
Proceedings of the 2018 International Conference on Management of Data, 1433 …, 2018
1792018
Formal Semantics of the Language Cypher
N Francis, A Green, P Guargliardo, L Libkin, T Lindaaker, V Marsault, ...
arXiv preprint arXiv:1802.09984, 2018
122018
On sets of numbers rationally represented in a rational base number system
V Marsault, J Sakarovitch
International Conference on Algebraic Informatics, 89-100, 2013
122013
Trees and languages with periodic signature
V Marsault, J Sakarovitch
Indagationes Mathematicae 28 (1), 221–246, 2017
112017
Ultimate periodicity of b-recognisable sets: a quasilinear procedure
V Marsault, J Sakarovitch
International Conference on Developments in Language Theory, 362-373, 2013
112013
The signature of rational languages
V Marsault, J Sakarovitch
Theoretical Computer Science 658, 216-234, 2017
92017
Énumeration et numération
V Marsault
Télécom-ParisTech, 2016
92016
Breadth-first serialisation of trees and rational languages
V Marsault, J Sakarovitch
Developments in Language Theory, 252-259, 2014
8*2014
Auto-similarity in rational base number systems
S Akiyama, V Marsault, J Sakarovitch
Combinatorics on Words, 34-45, 2013
72013
An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
B Boigelot, I Mainz, V Marsault, M Rigo
arXiv preprint arXiv:1702.03715, 2017
52017
Trees and Languages with Periodic Signature
V Marsault, J Sakarovitch
Latin American Symposium on Theoretical Informatics, 605-618, 2016
4*2016
Surminimisation of Automata
V Marsault
International Conference on Developments in Language Theory, 352-363, 2015
22015
Isabelle Mainz, Victor Marsault, and Michel Rigo. An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention, 2017
B Boigelot
Preprint, 0
2
An efficient algorithm to decide periodicity of b-recognisable sets using LSDF convention
V Marsault
arXiv preprint arXiv:1708.06228, 2017
12017
On subtrees of the representation tree in rational base numeration systems
J Sakarovitch, V Marsault, S Akiyama
Discrete Mathematics & Theoretical Computer Science 20, 2018
2018
Logic characterisation of p/q-recognisable sets
V Marsault
arXiv preprint arXiv:1801.08707, 2018
2018
On subtrees of the representation tree in rational base numeration systems
S Akiyama, V Marsault, J Sakarovitch
arXiv preprint arXiv:1706.08266, 2017
2017
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–17