Recognizable sets and power sets of finite semigroups
From MaRDI portal
Publication:1139135
DOI10.1007/BF02574198zbMath0433.20045MaRDI QIDQ1139135
Publication date: 1979
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/134363
divisionsyntactic monoidrecognizable setfinite monoidfree monoid over a finite alphabetM- varietypower sets of finite semigroups
Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (21)
Shuffle on positive varieties of languages ⋮ Shuffle product of regular languages: results and open problems ⋮ Upper set monoids and length preserving morphisms ⋮ On varieties of rational languages and variable-length codes ⋮ Unnamed Item ⋮ Products of languages with counter ⋮ Counting monoids and rational languages ⋮ The product of rational languages ⋮ Locally commutative power semigroups and counting factors of words ⋮ Closure of varieties of languages under products with counter ⋮ A Robust Class of Regular Languages ⋮ Power structures ⋮ Difference hierarchies and duality with an application to formal languages ⋮ On power varieties of semigroups ⋮ Constructing divisions into power groups ⋮ On fixed points of the lower set operator ⋮ On M-varieties generated by power monoids ⋮ Power monoids and finite J-trivial monoids ⋮ An application of the matrix representation of transductions ⋮ Power pseudovarieties of semigroups. I ⋮ Power pseudovarieties of semigroups. II
Cites Work
This page was built for publication: Recognizable sets and power sets of finite semigroups
