scientific article; zbMATH DE number 4003548

zbMath0618.68063MaRDI QIDQ4728262

Marek Chrobak, Wojciech Rytter

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitypartially commutative alphabetunique decipherability problemcommutativity relation graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

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 ⋮ Unique decipherability in the monoid of languages: an application of rational relations ⋮ Unique Decipherability in the Monoid of Languages: An Application of Rational Relations