Infinite words and biprefix codes

DOI10.1016/0020-0190(94)00053-0zbMath0810.68108OpenAlexW2006002764MaRDI QIDQ1330657

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

combinatorial problemsformal languages

Mathematics Subject Classification ID

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

Related Items (2)

On some factorizations of infinite words by elements of codes ⋮ A hierarchy for circular codes

Cites Work

• Intracommutativity properties for groups and semigroups
• FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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