scientific article; zbMATH DE number 3854451

MaRDI QIDQ3323299zbMATH OpenFDO

Authors Ping Hwei Day, H. J. Shyr

Publication date 1983

zbMATH Keywords

antichainscodesformal languagesfree monoidpartial ordersprimitive wordsregular languages

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• scientific article; zbMATH DE number 3987346
• Codes, orderings, and partial words
• Relations on free monoids, their independent sets, and codes¹
• Free submonoids in the monoid of languages
• Publication:3033350

Cited in

(15)

• 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
• Relatively regular languages and thin codes
• scientific article; zbMATH DE number 4131692 (Why is no real title available?)
• scientific article; zbMATH DE number 3987346 (Why is no real title available?)
• scientific article; zbMATH DE number 4077565 (Why is no real title available?)
• scientific article; zbMATH DE number 3570366 (Why is no real title available?)
• Atoms and partial orders of infinite languages
• scientific article; zbMATH DE number 858444 (Why is no real title available?)
• Out subword-free languages and its subclasses
• Minimal strings in a regular language with respect to a partial order on the alphabet
• 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 Q3323299)