We investigate the relation between bifix codes and interval exchange transformations. We prove that the class of natural codings of regular interval exchange transformations is closed under maximal bifix decoding
International audienceThis is a survey on the big questions about interval exchanges (minimality, un...
AbstractWe prove new results concerning the relation between bifix codes, episturmian words and subg...
Sets of words of linear complexity play an important role in combinatorics on words and symbolic dyn...
We investigate the relation between bifix codes and interval exchange transformations. We prove that...
International audienceWe consider a class of sets of words which is a natural common generalization ...
The languages generated by interval exchange transformations have been characterized by Ferenczi-Zam...
peer reviewedWe describe in this paper a connection between bifix codes, symbolic dynamical systems ...
We introduce a definition of admissibility for subintervals in interval exchange transformations. Us...
Abstract. This paper gives a complete characterization of those sequences of subword complexity (k −...
International audienceWe prove new results concerning the relation between bifix codes, episturmian ...
International audienceThis is a survey on the big questions about interval exchanges (minimality, un...
AbstractWe prove new results concerning the relation between bifix codes, episturmian words and subg...
Sets of words of linear complexity play an important role in combinatorics on words and symbolic dyn...
We investigate the relation between bifix codes and interval exchange transformations. We prove that...
International audienceWe consider a class of sets of words which is a natural common generalization ...
The languages generated by interval exchange transformations have been characterized by Ferenczi-Zam...
peer reviewedWe describe in this paper a connection between bifix codes, symbolic dynamical systems ...
We introduce a definition of admissibility for subintervals in interval exchange transformations. Us...
Abstract. This paper gives a complete characterization of those sequences of subword complexity (k −...
International audienceWe prove new results concerning the relation between bifix codes, episturmian ...
International audienceThis is a survey on the big questions about interval exchanges (minimality, un...
AbstractWe prove new results concerning the relation between bifix codes, episturmian words and subg...
Sets of words of linear complexity play an important role in combinatorics on words and symbolic dyn...
DOI
Add to ORKG