Searching for authors named "Christophe Reutenauer" – sorted by Relevance.
5 documents found, showing 1 through 5.
-
Cyclic languages and Strongly cyclic languages
- …. We prove that cyclic languages are the boolean closure of languages called strongly cyclic languages. The result is used to give another proof of the rationality of the zeta function of rational cyclic languages. 1 Introduction Cyclic languages and strongly cyclic languages are two classes of lang…
- Add To MetaCart
-
A conjecture on the Hall topology for the free group
- …The Hall topology for the free group is the coarsest topology such that every group morphism from the free group onto a finite discrete group is continuous. It was shown by M. Hall Jr that every finitely generated subgroup of the free group is closed for this topology. We conjecture that if H1 ; H2 …
- Cited by 19 (2 self) – Add To MetaCart
-
On a divisibility property of Fibonacci polynomials. submitted
- ……
- Cited by 1 (0 self) – Add To MetaCart
-
Higher Lie idempotents
- …this paper in their combinatorics in relation to the structure of bialgebras. Given a familly of Lie idempotents, using their convolution products, we construct and study families of idempotents whose properties yield an e#ective proof of the dual Leray theorem. In particular, we define three famill…
- Cited by 2 (1 self) – Add To MetaCart
-
CODES AND NONCOMMUTATIVE STOCHASTIC MATRICES
- …Abstract. Given a matrix over a skew-field fixing the column t (1,..., 1), we give formulas for a row vector fixed by this matrix. The same techniques are applied to give noncommutative extensions of probabilistic properties of codes. 1.…
- Add To MetaCart
Showing 1 through 5.
