The finest homophonic partition and related code concepts

DOI10.1007/3-540-58338-6_108zbMath1493.68412OpenAlexW1595793419MaRDI QIDQ5096920

No author found.

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_108

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items (2)

Factorization in Formal Languages ⋮ Unique decipherability in formal languages

Cites Work

• Splicing semigroups of dominoes and DNA
• Multiplicities: A deterministic view of nondeterminism
• A fast algorithm for the unique decipherability of multivalued encodings
• Dominoes over a free monoid
• On multiset decipherable codes (Corresp.)
• Deciding multiset decipherability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The finest homophonic partition and related code concepts