The following pages link to Maximal bifix decoding (Q2514159):
Displaying 23 items.
- A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid (Q512189) (← links)
- Neutral and tree sets of arbitrary characteristic (Q728278) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- On the group of a rational maximal bifix code (Q2178790) (← links)
- The finite index basis property (Q2259171) (← links)
- Bifix codes and interval exchanges (Q2259187) (← links)
- Acyclic, connected and tree sets (Q2339363) (← links)
- Specular sets (Q2358694) (← links)
- Balancedness and coboundaries in symbolic systems (Q2422021) (← links)
- On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts (Q2659850) (← links)
- Completely reducible sets (Q2842026) (← links)
- Return words of linear involutions and fundamental groups (Q2986615) (← links)
- Codes and Automata in Minimal Sets (Q3449355) (← links)
- Enumeration Formulæ in Neutral Sets (Q3451104) (← links)
- Interval exchanges, admissibility and branching Rauzy induction (Q4637855) (← links)
- Rigidity and Substitutive Dendric Words (Q4683228) (← links)
- Eventually dendric shift spaces (Q4991746) (← links)
- -adic characterization of minimal ternary dendric shifts (Q5053864) (← links)
- On Morphisms Preserving Palindromic Richness (Q5066068) (← links)
- Freeness of Schützenberger groups of primitive substitutions (Q5097705) (← links)
- Recognizability for sequences of morphisms (Q5235114) (← links)
- Some properties of morphic images of (eventually) dendric words (Q6072923) (← links)
- A profinite approach to complete bifix decodings of recurrent languages (Q6133256) (← links)
