A characterization of rational star languages generated by strong codes

DOI10.1007/BF02573118zbMath0624.20046MaRDI QIDQ1092172

Louxin Zhang

Publication date: 1987

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/134882

zbMATH Keywords

words; free monoid; permutation property; strong code

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20M05: Free semigroups, generators and relations, word problems

20M25: Semigroup rings, multiplicative semigroups of rings

Cites Work

• On the Burnside problem for semigroups
• Rational languages and the Burnside problem
• Unnamed Item
• Unnamed Item