On some factorizations of infinite words by elements of codes
From MaRDI portal
Publication:287095
DOI10.1016/S0020-0190(97)00080-XzbMATH Open1336.68156OpenAlexW2036025921WikidataQ114122748 ScholiaQ114122748MaRDI QIDQ287095FDOQ287095
Authors: J. Justin, Giuseppe Pirillo 
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
Recommendations
Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45) Combinatorics on words (68R15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
- Title not available (Why is that?)
- Title not available (Why is that?)
- A division property of the Fibonacci word
- Factorizations of free monoids and unavoidable regularities
Cited In (10)
- Title not available (Why is that?)
- A hierarchy for circular codes
- A defect theorem for bi-infinite words.
- A characterization of periodicity of bi-infinite words
- Defect effect of Bi-infinite words in the two-element case
- Factorisation des ensembles préfixiels
- Infinite words and biprefix codes
- Title not available (Why is that?)
- Properties of infinite words: recent results
- On prefixal factorizations of 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)
