Infinite words and biprefix codes

DOI10.1016/0020-0190(94)00053-0MaRDI QIDQ1330657zbMATH OpenOpenAlexFDO

Authors Giuseppe Pirillo

Publication date 18 April 1995

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

Full work available at URL https://doi.org/10.1016/0020-0190(94)00053-0

zbMATH Keywords

formal languagescombinatorial problems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• On some factorizations of infinite words by elements of codes
• A property of biprefix codes
• Finitary codes for biinfinite words
• On subwords of infinite words
• On the degree of finite maximal biprefix codes

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3711961 (Why is no real title available?)
• scientific article; zbMATH DE number 29220 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
• Intracommutativity properties for groups and semigroups

Cited in

(9)

• A hierarchy for circular codes
• On some factorizations of infinite words by elements of codes
• Intertwined infinite binary words
• Bifix codes and Sturmian words
• A property of biprefix codes
• Bi-infinitary codes
• Finitary codes for biinfinite words
• Binary words containing infinitely many overlaps
• Equivalence of right infinite words

This page was built for publication: Infinite words and biprefix codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330657)