Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Rindone, Giuseppina"'
Autor:
Dolce, Francesco, Perrin, Dominique, Restivo, Antonio, Reutenauer, Christophe, Rindone, Giuseppina
A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is completely
Externí odkaz:
http://arxiv.org/abs/1703.10081
Autor:
Berthé, Valérie, De Felice, Clelia, Delecroix, Vincent, Dolce, Francesco, Leroy, Julien, Perrin, Dominique, reutenauer, Christophe, Rindone, Giuseppina
We introduce the notion of specular sets which are subsets of groups called here specular and which form a natural generalization of free groups. These sets are an abstract generalization of the natural codings of linear involutions. We prove several
Externí odkaz:
http://arxiv.org/abs/1505.00707
Autor:
Berthé, Valérie, De Felice, Clelia, Dolce, Francesco, Leroy, Julien, Perrin, Dominique, Reutenauer, Christophe, Rindone, Giuseppina
Publikováno v:
J. Pure Appl. Algebra, 19 (2015) 2781-2798
We investigate the relation between bifix codes and interval exchange transformations. We prove that the class of natural codings of regular interval echange transformations is closed under maximal bifix decoding.
Comment: arXiv admin note: subs
Comment: arXiv admin note: subs
Externí odkaz:
http://arxiv.org/abs/1408.0389
Autor:
Berthé, Valérie, Delecroix, Vincent, Dolce, Francesco, Perrin, Dominique, Reutenauer, Christophe, Rindone, Giuseppina
We investigate the natural codings of linear involutions. We deduce from the geometric representation of linear involutions as Poincar\'e maps of measured foliations a suitable definition of return words which yields that the set of first return word
Externí odkaz:
http://arxiv.org/abs/1405.3529
Autor:
Berthé, Valérie, De Felice, Clelia, Dolce, Francesco, Perrin, Dominique, Reutenauer, Christophe, Rindone, Giuseppina
We prove in this note that, for an alphabet with three letters, the set of first return to a given word in a set satisfying the tree condition is a basis of the free group.
Externí odkaz:
http://arxiv.org/abs/1308.5618
Autor:
Berthé, Valérie, De Felice, Clelia, Dolce, Francesco, Leroy, and Julien, Perrin, Dominique, Reutenauer, Christophe, Rindone, Giuseppina
Publikováno v:
Discrete Math. 338 (2015)725-742
We introduce a class of sets of words which is a natural common generalization of Sturmian sets and of interval exchange sets. This class of sets consists of the uniformly recurrent tree sets, where the tree sets are defined by a condition on the pos
Externí odkaz:
http://arxiv.org/abs/1308.5396
Autor:
Berthé, Valerie, De Felice, Clelia, Dolce, Francesco, Leroy, Julien, Perrin, Dominique, Reutenauer, Christophe, Rindone, Giuseppina
Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words defined by t
Externí odkaz:
http://arxiv.org/abs/1308.4260
Autor:
Berthé, Valérie, De Felice, Clelia, Dolce, Francesco, Leroy, Julien, Perrin, Dominique, Reutenauer, Christophe, Rindone, Giuseppina
Publikováno v:
J. Pure Appl. Algebra, 219 (2015) 2521-2537
We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbolic systems corresponding to Sturmian words. We introduce a class of s
Externí odkaz:
http://arxiv.org/abs/1305.0127
Autor:
Berstel, Jean, De Felice, Clelia, Perrin, Dominique, Reutenauer, Christophe, Rindone, Giuseppina
Publikováno v:
Journal of Algebra, 369, 146-202, 2012
We prove new results concerning the relation between bifix codes, episturmian words and subgroups offree groups. We study bifix codes in factorial sets of words. We generalize most properties of ordinary maximal bifix codes to bifix codes maximal in
Externí odkaz:
http://arxiv.org/abs/1011.5369
Autor:
Berthé, Valérie, De Felice, Clelia, Delecroix, Vincent, Dolce, Francesco, Leroy, Julien, Perrin, Dominique, Reutenauer, Christophe, Rindone, Giuseppina
Publikováno v:
In Theoretical Computer Science 7 July 2017 684:3-28
