scientific article; zbMATH DE number 3987346
From MaRDI portal
Publication:3751630
Recommendations
Cited in
(16)- Strongly compatible total orders on free monoids
- Languages whose \(n\)-element subsets are codes
- Outfix and infix codes and related classes of languages
- Note on compatible well orders on a free monoid
- Anti-commutative languages and n-codes
- An order topology for finitely generated free monoids
- scientific article; zbMATH DE number 4131692 (Why is no real title available?)
- scientific article; zbMATH DE number 3854451 (Why is no real title available?)
- scientific article; zbMATH DE number 4081465 (Why is no real title available?)
- Disjunctive languages and compatible orders
- Relations on free monoids, their independent sets, and codes1
- scientific article; zbMATH DE number 2068875 (Why is no real title available?)
- Coding and strong coding in trace monoids
- n-Prefix–suffix languages∗
- scientific article; zbMATH DE number 858444 (Why is no real title available?)
- Codes defined by multiple sets of trajectories
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751630)