scientific article; zbMATH DE number 4003548

MaRDI QIDQ4728262zbMATH OpenFDO

Authors Marek Chrobak, Wojciech Rytter

Publication date 1986

zbMATH Keywords

complexitypartially commutative alphabetunique decipherability problemcommutativity relation graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4033664
• On the decidability of some problems about rational subsets of free partially commutative monoids
• scientific article; zbMATH DE number 3883641
• Rewriting systems and word problems in a free partially commutative monoid
• Unique decipherability in formal languages

Cited in

(7)

• Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
• Unique decipherability in formal languages
• On the decidability of some problems about rational subsets of free partially commutative monoids
• Rational, recognizable, and aperiodic partially lossy queue languages
• The monoid of queue actions
• scientific article; zbMATH DE number 4033664 (Why is no real title available?)
• Unique decipherability in the monoid of languages: an application of rational relations

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 Q4728262)