Free submonoids in the monoid of languages

DOI10.1016/S0012-365X(97)00037-XzbMath0898.20036MaRDI QIDQ1381858

H. J. Shyr, Yen-Shung Tsai

Publication date: 24 August 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

monoidslanguagesfree submonoidsfinite prefix codes

Mathematics Subject Classification ID

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

Related Items (3)

Word-paired catenations of regular languages ⋮ Some kinds of primitive and non-primitive words ⋮ ORDERED AND $\mathcal{J}$-TRIVIAL SEMIGROUPS AS DIVISORS OF SEMIGROUPS OF LANGUAGES

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• Codes conjugués
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Free submonoids in the monoid of languages