Artículo de publicación ISIWe define class-closing factor codes from shifts of finite type and show that they are continuing if their domains are irreducible and their images are of finite type. We establish several relations between class-closing factor codes, continuing factor codes and constant-class-to-one factor codes. In particular it is shown that a factor code between irreducible shifts of finite type is constant-class-to-one if and only if it is bi-class-closing, generalizing a result of Nasu.FONDECYT 11140369 313071
AbstractWe study the notion of a code in a sofic subshift. We first give a generalization of the Kra...
International audienceWe study the relationship between codes and unambiguous automata inside a sofi...
AbstractWe study the relationship between codes and unambiguous automata inside a sofic system. We s...
Artículo de publicación ISIGiven a factor code pi from a shift of finite type X onto a sofic shift Y...
Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets an...
A sliding block code π : X → Y between shift spaces is called fiber-mixing if, for every x a...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
AbstractWe define a code in a sofic shift as a set of blocks of symbols of the shift such that any b...
AbstractEach set of operations selected from union, intersection, complement, star, quotients, deriv...
Codes can be characterized by their way of acting on infinite words. Three kinds of characterization...
Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (U...
Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability ...
We introduce the following notion of weak equivalence between shifts of finite type. Two shifts of f...
AbstractLet A be a finite set. A code is a subset of the A∗ of all finite sequences on A with the pr...
AbstractWe study the notion of a code in a sofic subshift. We first give a generalization of the Kra...
International audienceWe study the relationship between codes and unambiguous automata inside a sofi...
AbstractWe study the relationship between codes and unambiguous automata inside a sofic system. We s...
Artículo de publicación ISIGiven a factor code pi from a shift of finite type X onto a sofic shift Y...
Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets an...
A sliding block code π : X → Y between shift spaces is called fiber-mixing if, for every x a...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
AbstractWe define a code in a sofic shift as a set of blocks of symbols of the shift such that any b...
AbstractEach set of operations selected from union, intersection, complement, star, quotients, deriv...
Codes can be characterized by their way of acting on infinite words. Three kinds of characterization...
Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (U...
Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability ...
We introduce the following notion of weak equivalence between shifts of finite type. Two shifts of f...
AbstractLet A be a finite set. A code is a subset of the A∗ of all finite sequences on A with the pr...
AbstractWe study the notion of a code in a sofic subshift. We first give a generalization of the Kra...
International audienceWe study the relationship between codes and unambiguous automata inside a sofi...
AbstractWe study the relationship between codes and unambiguous automata inside a sofic system. We s...