On the public citation graph

Power monoids and finiteJ-trivial monoids

https://doi.org/10.1007/bf02573319
0 signed · 22 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-07407-4_23openalex-snapshot
Piecewise testable events
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/bf02195758openalex-snapshot
On the maximal semilattice decomposition of the power semigroup of a semigroup
inferredcites →https://doi.org/10.1007/bf02572507openalex-snapshot
On finite ℐ-trivial monoids
inferredcites →https://doi.org/10.1007/bf02572667openalex-snapshot
Varietes de langages et monoide des parties
inferredcites →https://doi.org/10.1007/bf02572813openalex-snapshot
On M-varieties generated by power monoids
inferredcites →https://doi.org/10.1007/bf02574198openalex-snapshot
Recognizable sets and power sets of finite semigroups
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot
SEMIGROUPS AND COMBINATORIAL APPLICATIONS
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.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/978-94-009-3839-7_22openalex-snapshot
On the Recent Results in the Study of Power Semigroups
inferred← citeshttps://doi.org/10.1007/s00233-022-10305-2openalex-snapshot
Identities of the stylic monoid
inferred← citeshttps://doi.org/10.1007/s13226-026-00986-8openalex-snapshot
Boolean matrix semigroup associated with permutations
inferred← citeshttps://doi.org/10.1016/0021-8693(89)90183-xopenalex-snapshot
On power varieties of semigroups
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90019-2openalex-snapshot
Une application de la representation matricielle des transductions
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2023.06.014openalex-snapshot
Catalan monoids inherently nonfinitely based relative to finite R -trivial semigroups
inferred← citeshttps://doi.org/10.1090/proc/16732openalex-snapshot
A conjecture by Bienvenu and Geroldinger on power monoids
inferred← citeshttps://doi.org/10.1142/s021819670800486xopenalex-snapshot
ORDERED AND $\mathcal{J}$-TRIVIAL SEMIGROUPS AS DIVISORS OF SEMIGROUPS OF LANGUAGES
inferred← citeshttps://doi.org/10.1142/s0218196710005935openalex-snapshot
ORDERED SEMIGROUPS, UPPER-TRIANGULAR REFLEXIVE RELATIONS AND SEMIGROUPS OF LANGUAGES
inferred← citeshttps://doi.org/10.1145/3303991openalex-snapshot
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
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.