Minimal complete sets of words

DOI10.1016/0304-3975(80)90062-6MaRDI QIDQ1145771zbMATH OpenOpenAlexFDO

Authors Antonio Restivo, Jean-Marie Boë, Aldo De Luca

Publication date 1980

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(80)90062-6

zbMATH Keywords

free monoidmaximal codeminimal complete settwo-sided ideals

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Ideal theory for semigroups (20M12) Semigroups in automata theory, linguistics, etc. (20M35)

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3228255 (Why is no real title available?)
• On codes having no finite completions

Cited in

(10)

• Noncommutative factorization of variable-length codes
• A conjecture on continued fractions
• Some combinatorial results on Bernoulli sets and codes
• Locally complete sets and finite decomposable codes
• Completions in measure of languages and related combinatorial problems
• Coding by minimal linear grammars
• On the length of uncompletable words in unambiguous automata
• On incomplete and synchronizing finite sets
• On codes with a finite deciphering delay: Constructing uncompletable words
• On the Commutative Equivalence of Algebraic Formal Series and Languages

This page was built for publication: Minimal complete sets of words

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