Recognizable sets and power sets of finite semigroups
From MaRDI portal
Cited in
(23)- On M-varieties generated by power monoids
- An application of the matrix representation of transductions
- Power pseudovarieties of semigroups. I
- Power pseudovarieties of semigroups. II
- On varieties of rational languages and variable-length codes
- Counting monoids and rational languages
- Closure of varieties of languages under products with counter
- Power structures
- On power varieties of semigroups
- Shuffle on positive varieties of languages
- Difference hierarchies and duality with an application to formal languages
- Constructing divisions into power groups
- A Robust Class of Regular Languages
- scientific article; zbMATH DE number 3724720 (Why is no real title available?)
- Upper set monoids and length preserving morphisms
- The product of rational languages
- On fixed points of the lower set operator
- Shuffle product of regular languages: results and open problems
- Locally commutative power semigroups and counting factors of words
- The pseudovariety \(\mathbf{Com}\ast\mathbf{D}\) viewed as a power pseudovariety
- Seventy years of algebraic, logical, and topological methods for regular languages
- Power monoids and finite J-trivial monoids
- Products of languages with counter
This page was built for publication: Recognizable sets and power sets of finite semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1139135)
