On uniqueness of alphabetic decoding

DOI10.1515/DMA-2012-039MaRDI QIDQ5299972zbMATH OpenOpenAlexFDO

Authors Petr S. Dergach

Publication date 24 June 2013

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4213/dm1211

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(5)

• A fast algorithm for the unique decipherability of multivalued encodings
• Is Non-Unique Decoding Necessary?
• On Unique Decodability
• scientific article; zbMATH DE number 1353836 (Why is no real title available?)
• Uniquely decodable n-gram embeddings

This page was built for publication: On uniqueness of alphabetic decoding

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