2 citations · 2 across the 3 of their papers we have counts for
4 papers
Automata and automatic sequences
Jean-Paul Allouche, Michel Mendès France
In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into s…
Combinatorial Variations on Cantor's Diagonal
Srečko Brlek, Jean-Philippe Labbé, Michel Mendès France
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces…
Complexity of the Fibonacci snowflake
Alexandre Blondin Massé, Srečko Brlek, Sébastien Labbé +1
The object under study is a particular closed curve on the square lattice related with the Fibonacci sequence . It belongs to a class of curves whose length is $4F_{3n+…
Cantorian Tableaux and Permanents
Srečko Brlek, Michel Mendès France, John Michael Robson +1
This article could be called "theme and variations" on Cantor's celebrated diagonal argument. Given a square nxn tableau T=(a_i^j) on a finite alphabet A, let L be the set of its r…