The following pages link to Dominique Perrin (Q213071):
Displayed 50 items.
- A hierarchy of shift equivalent sofic shifts (Q2575742) (← links)
- On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts (Q2659850) (← links)
- (Q2704225) (← links)
- (Q2776539) (← links)
- COMPLETELY REDUCIBLE SETS (Q2842026) (← links)
- Generating Functions of Timed Languages (Q2912714) (← links)
- (Q2949152) (← links)
- Return words of linear involutions and fundamental groups (Q2986615) (← links)
- (Q3062121) (← links)
- A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA (Q3086238) (← links)
- (Q3086922) (← links)
- (Q3123633) (← links)
- (Q3125083) (← links)
- Factorizing The Polynomial of a Code (Q3220763) (← links)
- (Q3332251) (← links)
- Codes and Automata in Minimal Sets (Q3449355) (← links)
- Specular Sets (Q3449371) (← links)
- Enumeration Formulæ in Neutral Sets (Q3451104) (← links)
- On the generating sequences of regular languages on <i>k</i> symbols (Q3452513) (← links)
- Symbolic dynamics and finite automata (Q3569002) (← links)
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (Q3637215) (← links)
- (Q3653240) (← links)
- (Q3667090) (← links)
- (Q3668879) (← links)
- Codes and Bernoulli partitions (Q3671046) (← links)
- (Q3677189) (← links)
- (Q3698327) (← links)
- (Q3714479) (← links)
- (Q3718174) (← links)
- (Q3736919) (← links)
- (Q3738586) (← links)
- (Q3741086) (← links)
- (Q3742743) (← links)
- Ensembles Reconnaissables de Mots Biinfinis (Q3756537) (← links)
- (Q3805903) (← links)
- (Q3817636) (← links)
- (Q3832063) (← links)
- (Q3838997) (← links)
- (Q3852109) (← links)
- (Q3901702) (← links)
- (Q3942894) (← links)
- (Q3945609) (← links)
- (Q3977589) (← links)
- (Q4037012) (← links)
- (Q4100680) (← links)
- (Q4103466) (← links)
- (Q4132109) (← links)
- (Q4132392) (← links)
- (Q4139707) (← links)
- Codes asynchrones (Q4173294) (← links)