Minimal complete sets of words
From MaRDI portal
Publication:1145771
DOI10.1016/0304-3975(80)90062-6zbMath0446.20036OpenAlexW2081502327MaRDI QIDQ1145771
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
Ideal theory for semigroups (20M12) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Noncommutative factorization of variable-length codes ⋮ Coding by minimal linear grammars ⋮ On the Commutative Equivalence of Algebraic Formal Series and Languages ⋮ On the length of uncompletable words in unambiguous automata ⋮ On incomplete and synchronizing finite sets ⋮ Completions in measure of languages and related combinatorial problems ⋮ On codes with a finite deciphering delay: Constructing uncompletable words ⋮ A conjecture on continued fractions ⋮ Some combinatorial results on Bernoulli sets and codes ⋮ Locally complete sets and finite decomposable codes
Cites Work
