Solid codes and disjunctive domains
From MaRDI portal
Publication:909801
DOI10.1007/BF02573375zbMath0695.20038MaRDI QIDQ909801
Publication date: 1990
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/135033
free monoid; word; alphabet; disjunctive domains; related pair; right disjunctive domain; solid codes
Related Items
Variable-length codes for error correction, (Near-)inverses of sequences, P-disjunctive ω-languages, Properties of pure codes, Finite maximal solid codes, The applications of solid codes to r-R and r-D languages, f-disjunctive congruences and a generalization of monoids with length, Synchronization, \(d\)-minimal languages, Some results in \(r\)-disjunctive languages and related topics, Some combinatorial properties of solid codes, Some results on \((k, m)\)-comma codes, Automata for solid codes, Solid codes and the uniform density of fd-domains.
Cites Work