Relations on free monoids, their independent sets, and codes1
From MaRDI portal
Publication:3979693
Recommendations
Cites work
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- n-Prefix–suffix languages∗
- A characterization of intercodes
- Anti-commutative languages and n-codes
- Hypercodes
- On free monoids partially ordered by embedding
- Ordering by Divisibility in Abstract Algebras
- Shuffle Relations and Codes
- Syntaktische Monoide und Hypercodes
- The syntactic monoid of a hypercode
Cited in
(20)- Variable-length codes independent or closed with respect to edit relations
- Morphisms preserving densities
- scientific article; zbMATH DE number 522835 (Why is no real title available?)
- Codes defined by multiple sets of trajectories
- Relativized codes
- scientific article; zbMATH DE number 3854451 (Why is no real title available?)
- scientific article; zbMATH DE number 3987346 (Why is no real title available?)
- \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes
- Decision problems for convex languages
- Is independence an exception?
- Dependences related to strict binary relations
- On some classes of codes defined by binary relations
- Transducers and the decidability of independence in free monoids
- Compatibility relations on codes and free monoids
- Formal descriptions of code properties: decidability, complexity, implementation
- Languages whose \(n\)-element subsets are codes
- Some properties of involution binary relations
- Note on the topological structure of random strings
- Variable-length codes for error correction
- 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)
