Relations on free monoids, their independent sets, and codes1

DOI10.1080/00207169108803999zbMath0737.68052OpenAlexW2036426487MaRDI QIDQ3979693

No author found.

Publication date: 26 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108803999

zbMATH Keywords

codesbinary relations

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Linear codes (general theory) (94B05)

Related Items

Morphisms preserving densities, Transducers and the decidability of independence in free monoids, FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION, Codes defined by multiple sets of trajectories, \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes, Relativized codes, Some properties of involution binary relations, Languages whose \(n\)-element subsets are codes, Variable-length codes for error correction, Note on the topological structure of random strings, Decision problems for convex languages, Is independence an exception?, Variable-length codes independent or closed with respect to edit relations, Dependences related to strict binary relations

Cites Work

• Unnamed Item
• Syntaktische Monoide und Hypercodes
• Anti-commutative languages and n-codes
• The syntactic monoid of a hypercode
• A characterization of intercodes
• Shuffle Relations and Codes
• n-Prefix–suffix languages^∗
• Hypercodes
• On free monoids partially ordered by embedding
• Ordering by Divisibility in Abstract Algebras