On some factorizations of infinite words by elements of codes

DOI10.1016/S0020-0190(97)00080-XzbMath1336.68156OpenAlexW2036025921WikidataQ114122748 ScholiaQ114122748MaRDI QIDQ287095

Giuseppe Pirillo, Jacques Justin

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00080-x

zbMATH Keywords

combinatorial problemsformal languagesinfinite wordstheory of codes

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (1)

A hierarchy for circular codes

Cites Work

• A division property of the Fibonacci word
• Factorizations of free monoids and unavoidable regularities
• Shirshov's theorem and \(\omega\)-permutability of semigroups
• Outfix and infix codes and related classes of languages
• Infinite words and biprefix codes
• Palindromes in the Fibonacci word
• Viennot factorization of infinite words
• FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some factorizations of infinite words by elements of codes