5 papers
Automata for the commutative closure of regular sets
Verónica Becher, Simon Lew Deveali, Ignacio Mollo Cunningham
Consider , the free monoid generated by the finite alphabet with the concatenation operation. Two words have the same commutative image when one is a permutation of the…
Poisson genericity in numeration systems with exponentially mixing probabilities
Nicolás Álvarez, Verónica Becher, Eda Cesaratto +3
We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if…
De Bruijn Sequences with Minimum Discrepancy
Nicolás Álvarez, Verónica Becher, Martín Mereb +2
The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string.…
The discrepancy of the Champernowne constant
Verónica Becher, Nicole Graus
A number is normal in base if, in its base expansion, all blocks of digits of equal length have the same asymptotic frequency. The rate at which a number approaches normali…
Lyndon pairs and the lexicographically greatest perfect necklace
Verónica Becher, Tomás Tropea
Fix a finite alphabet. A necklace is a circular word. For positive integers and~, a necklace is -perfect if all words of length occur times but at positions w…