On the public citation graph

A finiteness condition for finitely generated semigroups

https://doi.org/10.1007/bf02572479
0 signed · 18 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.1016/0021-8693(79)90088-7openalex-snapshot
On finiteness conditions in semigroups
inferredcites →https://doi.org/10.1017/s0305004100027341openalex-snapshot
On semi-groups in which x r = x
inferredcites →https://doi.org/10.1137/0210039openalex-snapshot
Pumping Lemmas for Regular Sets

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11505877_8openalex-snapshot
Membership and Finiteness Problems for Rational Sets of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_34openalex-snapshot
A New Unavoidable Regularity in Free Monoids
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_11openalex-snapshot
Regularity and Finiteness Conditions
inferred← citeshttps://doi.org/10.1007/bf02572654openalex-snapshot
A note on the Burnside proble for semigroups
inferred← citeshttps://doi.org/10.1007/bf02573240openalex-snapshot
A finiteness condition for finitely generated semigroups
inferred← citeshttps://doi.org/10.1007/bf02573771openalex-snapshot
About the finiteness of monoids generated by closures and interiors
inferred← citeshttps://doi.org/10.1007/bf02924898openalex-snapshot
Sul problema di Burnside per i semigruppi e i linguaggi
inferred← citeshttps://doi.org/10.1007/bfb0013117openalex-snapshot
A finiteness condition for semigroups
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00140-ropenalex-snapshot
Some combinatorial properties of infinite words and applications to semigroup theory
inferred← citeshttps://doi.org/10.1016/0021-8693(91)90064-fopenalex-snapshot
A finiteness condition for semigroups generalizing a theorem of Hotzel
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90156-2openalex-snapshot
Rational languages and the Burnside problem
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90021-6openalex-snapshot
Notes on finitely generated semigroups and pumping conditions for regular languages
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90044-8openalex-snapshot
Notes on congruence relations and factor pumping conditions for rational languages
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90329-zopenalex-snapshot
Finiteness and iteration conditions for semigroups
inferred← citeshttps://doi.org/10.1142/s0129054106003954openalex-snapshot
MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
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.