Publication:4728262
From MaRDI portal
zbMath0618.68063MaRDI QIDQ4728262
Marek Chrobak, Wojciech Rytter
Publication date: 1986
complexity; partially commutative alphabet; unique decipherability problem; commutativity relation graph
68Q45: Formal languages and automata
Related Items
Rational, recognizable, and aperiodic partially lossy queue languages, Unique decipherability in the monoid of languages: an application of rational relations, On the decidability of some problems about rational subsets of free partially commutative monoids, The monoid of queue actions, Unique Decipherability in the Monoid of Languages: An Application of Rational Relations