Straubing, Howard Recognizable sets and power sets of finite semigroups. (English) Zbl 0433.20045 Semigroup Forum 18, 331-340 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 21 Documents MSC: 20M35 Semigroups in automata theory, linguistics, etc. 20M05 Free semigroups, generators and relations, word problems 20M07 Varieties and pseudovarieties of semigroups Keywords:power sets of finite semigroups; recognizable set; finite monoid; M- variety; division; free monoid over a finite alphabet; syntactic monoid PDFBibTeX XMLCite \textit{H. Straubing}, Semigroup Forum 18, 331--340 (1979; Zbl 0433.20045) Full Text: DOI EuDML References: [1] Eilenberg, S.,Automata Languages and Machines, Academic Press, New York, 1974 (Vol. A), and 1976 (Vol. B). · Zbl 0317.94045 [2] Perrot, J.-F.,Variétés de languages et opérations, Theoretical Computer Science 7 (1978). 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.