On some factorizations of infinite words by elements of codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 410199 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 5051583 (Why is no real title available?)
- scientific article; zbMATH DE number 4183705 (Why is no real title available?)
- A division property of the Fibonacci word
- FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
- Factorizations of free monoids and unavoidable regularities
- Infinite words and biprefix codes
- Outfix and infix codes and related classes of languages
- Palindromes in the Fibonacci word
- Shirshov's theorem and \(\omega\)-permutability of semigroups
- Viennot factorization of infinite words
Cited in
(10)- Factorisation des ensembles préfixiels
- scientific article; zbMATH DE number 4069205 (Why is no real title available?)
- A hierarchy for circular codes
- Properties of infinite words: recent results
- Infinite words and biprefix codes
- scientific article; zbMATH DE number 3911741 (Why is no real title available?)
- On prefixal factorizations of words
- A characterization of periodicity of bi-infinite words
- Defect effect of Bi-infinite words in the two-element case
- A defect theorem for bi-infinite words.
This page was built for publication: On some factorizations of infinite words by elements of codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287095)
