#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2013

2018

- This year (4)
- Last 5 years (16)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Victor Marsault, Jacques Sakarovitch
- LATIN
- 2016

The signature of a labelled tree (and hence of its prefix-closed branch language) is the sequence of the degrees of the nodes of the tree in the breadth-first traversal. In a previous work, we haveâ€¦ (More)

- Nadime Francis, Alastair Green, +7 authors AndrÃ©s Taylor
- SIGMOD Conference
- 2018

The Cypher property graph query language is an evolving language, originally designed and implemented as part of the Neo4j graph database, and it is currently used by several commercial databaseâ€¦ (More)

- Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch
- ArXiv
- 2013

This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highlyâ€¦ (More)

- Victor Marsault, Jacques Sakarovitch
- Developments in Language Theory
- 2013

It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structural description ofâ€¦ (More)

- Nadime Francis, Alastair Green, +8 authors AndrÃ©s Taylor
- ArXiv
- 2018

Cypher is a query language for property graphs. It was originally designed and implemented as part of the Neo4j graph database, and it is currently used in a growing number of commercial systems,â€¦ (More)

- Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch
- Discrete Mathematics & Theoretical Computerâ€¦
- 2018

Every rational number pq defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to the study of the setâ€¦ (More)

- Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch
- WORDS
- 2013

- Victor Marsault
- ArXiv
- 2018

Let pq be a rational number. Numeration in base p q is defined by a function that evaluates each finite word over Ap = {0, 1, . . . , pâˆ’ 1} to a rational number in some set Np q . In particular, Np qâ€¦ (More)

- Victor Marsault, Jacques Sakarovitch
- ArXiv
- 2014

This work introduces the idea of breadth-first generation of infinite trees and languages. It is orthogonal to usual descriptions by classical objects such as automata and grammars which refer moreâ€¦ (More)

- Victor Marsault, Jacques Sakarovitch
- Developments in Language Theory
- 2014