scientific article; zbMATH DE number 3883641

MaRDI QIDQ3217634zbMATH OpenFDO

Authors Christoph M. Hoffmann

Publication date 1984

zbMATH Keywords

pattern matchingstring matchingunique decipherability

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Artificial intelligence (68T99) Communication, information (94A99) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Some algorithms concerning uniquely decipherable codes
• Deciding multiset decipherability
• Unique decipherability in formal languages
• A novel test for unique decipherability of codes
• A fast algorithm for the unique decipherability of multivalued encodings

Cited in

(17)

• A fast algorithm for the unique decipherability of multivalued encodings
• Automata for solid codes
• Unique decipherability in formal languages
• Parsing with a finite dictionary
• Is Non-Unique Decoding Necessary?
• A novel test for unique decipherability of codes
• Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
• On Unique Decodability
• scientific article; zbMATH DE number 3970684 (Why is no real title available?)
• scientific article; zbMATH DE number 4033664 (Why is no real title available?)
• Deciding unique decodability of bigram counts via finite automata
• scientific article; zbMATH DE number 4003548 (Why is no real title available?)
• Deciding multiset decipherability
• The finest homophonic partition and related code concepts
• Some algorithms concerning uniquely decipherable codes
• Multiset and set decipherable codes
• Unique decipherability in the monoid of languages: an application of rational relations

This page was built for publication:

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