On the public citation graph

On finitely generated subsemigroups of a free semigroup

https://doi.org/10.1007/bf02572962
0 signed · 21 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/s0019-9958(58)90082-2openalex-snapshot
Finite state languages
inferredcites →https://doi.org/10.1090/s0002-9904-1965-11395-7openalex-snapshot
A note on free subsemigroups with two generators
inferredcites →https://doi.org/10.1090/surv/007.2openalex-snapshot
The Algebraic Theory of Semigroups, Volume II

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.2001.0500openalex-snapshot
Regular Gröbner Bases
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_95openalex-snapshot
Compactness of systems of equations in semigroups
inferred← citeshttps://doi.org/10.1007/bf01147120openalex-snapshot
On F-semigroups with three generators
inferred← citeshttps://doi.org/10.1007/bf02194675openalex-snapshot
Presentations et presentations simplifiables d'un monoïde simplifiable
inferred← citeshttps://doi.org/10.1007/bf02194863openalex-snapshot
Quelques Constructions Et Algorithmes Relatifs Aux Sous-Monoïdes D'un Monoïde Libre
inferred← citeshttps://doi.org/10.1007/bf02572484openalex-snapshot
Some algorithms on the star operation applied to finite languages
inferred← citeshttps://doi.org/10.1007/bf02573193openalex-snapshot
On the defect theorem and simplifiability
inferred← citeshttps://doi.org/10.1007/bfb0083421openalex-snapshot
Systems of equations over a finitely generated free monoid having an effectively findable equivalent finite subsystem
inferred← citeshttps://doi.org/10.1007/bfb0089813openalex-snapshot
Les presentations des sous-monoides de rang 3 d'un monoide libre
inferred← citeshttps://doi.org/10.1016/j.jpaa.2008.10.006openalex-snapshot
Malcev presentations for subsemigroups of direct products of coherent groups
inferred← citeshttps://doi.org/10.1016/j.jpaa.2011.03.017openalex-snapshot
Generators and relations for subsemigroups via boundaries in Cayley graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00380-1openalex-snapshot
The homomorphism problem for the free monoid
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00101-4openalex-snapshot
The homomorphism problem for trace monoids
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00311-8openalex-snapshot
A note on decidability questions on presentations of word semigroups
inferred← citeshttps://doi.org/10.1017/s0305004106009236openalex-snapshot
Subsemigroups of virtually free groups: finite Malcev presentations and testing for freeness
inferred← citeshttps://doi.org/10.1070/sm1980v036n04abeh001853openalex-snapshot
AN ALGEBRAIC STUDY OF THE SIMPLEST CODES AND COEFFICIENTLESS EQUATIONS IN WORDS
inferred← citeshttps://doi.org/10.1080/00927870500261058openalex-snapshot
Inverse Subsemigroups of the Monogenic Free Inverse Semigroup
inferred← citeshttps://doi.org/10.36045/bbms/1074791330openalex-snapshot
On syntactic groups
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.