Relations on free monoids, their independent sets, and codes1
From MaRDI portal
Publication:3979693
DOI10.1080/00207169108803999zbMATH Open0737.68052OpenAlexW2036426487MaRDI QIDQ3979693FDOQ3979693
Author name not available (Why is that?)
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
Formal languages and automata (68Q45) Combinatorics on words (68R15) Linear codes (general theory) (94B05)
Cites Work
- Title not available (Why is that?)
- Ordering by Divisibility in Abstract Algebras
- On free monoids partially ordered by embedding
- Hypercodes
- A characterization of intercodes
- Anti-commutative languages and n-codes
- n-Prefix–suffix languages∗
- Syntaktische Monoide und Hypercodes
- The syntactic monoid of a hypercode
- Shuffle Relations and Codes
Cited In (16)
- Variable-length codes independent or closed with respect to edit relations
- Morphisms preserving densities
- Title not available (Why is that?)
- Codes defined by multiple sets of trajectories
- \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes
- Relativized codes
- Decision problems for convex languages
- Is independence an exception?
- Dependences related to strict binary relations
- Transducers and the decidability of independence in free monoids
- Formal descriptions of code properties: decidability, complexity, implementation
- Languages whose \(n\)-element subsets are codes
- Some properties of involution binary relations
- Variable-length codes for error correction
- Note on the topological structure of random strings
- Shuffle Relations and Codes
This page was built for publication: Relations on free monoids, their independent sets, and codes1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979693)
