Shyr, H. J.; Yu, S. S.; Thierrin, G. Monogenic \(e\)-closed languages and dipolar words. (English) Zbl 0795.68115 Discrete Math. 126, No. 1-3, 339-348 (1994). Summary: Languages closed under insertion are called expansion-closed (\(e\)-closed) languages. If they are generated by a word \(u\), they are then called monogenic \(e\)-closed languages. Properties of these languages are studied, in particular when the word \(u\) is a power of a dipolar word and connections with codes are considered. Cited in 6 Documents MSC: 68Q45 Formal languages and automata 20M35 Semigroups in automata theory, linguistics, etc. Keywords:dipolar words; expansion-closed languages; free monoid; expansion-closed submonoids PDFBibTeX XMLCite \textit{H. J. Shyr} et al., Discrete Math. 126, No. 1--3, 339--348 (1994; Zbl 0795.68115) Full Text: DOI References: [1] Berstel, J.; Perrin, D., Theory of Codes (1985), Academic Press: Academic Press Orlando, Toronto · Zbl 1022.94506 [2] Jürgensen, H.; Shyr, H. J.; Thierrin, G., Monoids with disjunctive identity and their codes, Acta Math. Hungarica, 47, 299-312 (1986) · Zbl 0623.20052 [3] Lyndon, R. C.; Schürzenberger, M. P., The equation \(a^M=b^{N\) · Zbl 0106.02204 [4] Shyr, H. J., Free Monoids and Languages (1991), Dept. Mathematics, Soochow Univ: Dept. Mathematics, Soochow Univ Taipei, Lecture notes · Zbl 0746.20050 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.