On the public citation graph
On M-varieties generated by power monoids
0 signed · 27 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-09118-1_27openalex-snapshot
Sur les varietes de langages et de monoïdes
inferredcites →https://doi.org/10.1007/bf01114879openalex-snapshot
The maximal semilattice decomposition of a semigroup
inferredcites →https://doi.org/10.1007/bf02194921openalex-snapshot
Sur Le Produit De Concatenation Non Ambigu
inferredcites →https://doi.org/10.1007/bf02195758openalex-snapshot
On the maximal semilattice decomposition of the power semigroup of a semigroup
inferredcites →https://doi.org/10.1007/bf02389104openalex-snapshot
Semilattice decompositions of semigroups
inferredcites →https://doi.org/10.1007/bf02572667openalex-snapshot
Varietes de langages et monoide des parties
inferredcites →https://doi.org/10.1007/bf02574198openalex-snapshot
Recognizable sets and power sets of finite semigroups
inferredcites →https://doi.org/10.1016/0022-4049(79)90025-2openalex-snapshot
Aperiodic homomorphisms and the concatenation product of recognizable sets
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.3792/pja/1195522562openalex-snapshot
Another proof of a theorem concerning the greatest semilattice-decomposition of a semigroup
inferredcites →https://doi.org/10.4153/cjm-1979-099-1openalex-snapshot
Subgroups of the Power Semigroup of a Finite Semigroup
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jabr.1999.7993openalex-snapshot
The G-Exponent of a Pseudovariety of Semigroups
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_92openalex-snapshot
The product of rational languages
inferred← citeshttps://doi.org/10.1007/978-94-009-3839-7_18openalex-snapshot
Power Semigroups and Related Varieties of Finite Semigroups
inferred← citeshttps://doi.org/10.1007/bf02573209openalex-snapshot
Power pseudovarieties of semigroups I
inferred← citeshttps://doi.org/10.1007/bf02573210openalex-snapshot
Power pseudovarieties of semigroups II
inferred← citeshttps://doi.org/10.1007/bf02573319openalex-snapshot
Power monoids and finiteJ-trivial monoids
inferred← citeshttps://doi.org/10.1007/bf02573549openalex-snapshot
A unified syntactical approach to theorems of Putcha, Margolis, and Straubing on finite power semigroups
inferred← citeshttps://doi.org/10.1007/bf02573616openalex-snapshot
Powers of subsets in a finite semigroup
inferred← citeshttps://doi.org/10.1007/pl00006035openalex-snapshot
The Five-Element Brandt Semigroup as a Forbidden Divisor
inferred← citeshttps://doi.org/10.1007/s00233-025-10600-8openalex-snapshot
Epimorphisms and pseudovarieties of semigroups
inferred← citeshttps://doi.org/10.1007/s002330010088openalex-snapshot
The power exponent of a pseudovariety
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90227-kopenalex-snapshot
Locally commutative power semigroups and counting factors of words
inferred← citeshttps://doi.org/10.1016/j.jpaa.2011.10.022openalex-snapshot
Upper set monoids and length preserving morphisms
inferred← citeshttps://doi.org/10.1080/00927872.2023.2277413openalex-snapshot
Semiring and involution identities of powers of inverse semigroups
inferred← citeshttps://doi.org/10.2140/pjm.1984.111.125openalex-snapshot
Minimal noncommutative varieties and power varieties
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.