Infinite words and biprefix codes

DOI10.1016/0020-0190(94)00053-0zbMATH Open0810.68108OpenAlexW2006002764MaRDI QIDQ1330657FDOQ1330657

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

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

zbMATH Keywords

formal languagescombinatorial problems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
• Intracommutativity properties for groups and semigroups
• Title not available (Why is that?)

Cited In (9)

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