On the public citation graph

Quelques Constructions Et Algorithmes Relatifs Aux Sous-Monoïdes D'un Monoïde Libre

https://doi.org/10.1007/bf02194863
0 signed · 39 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/bf02570808openalex-snapshot
The intersection of free submonoids of a free monoid is free
inferredcites →https://doi.org/10.1007/bf02572941openalex-snapshot
Commutative semigroups whose homomorphic images in groups are groups
inferredcites →https://doi.org/10.1007/bf02572962openalex-snapshot
On finitely generated subsemigroups of a free semigroup
inferredcites →https://doi.org/10.1090/s0002-9939-1962-0139680-3openalex-snapshot
On Subsemigroups of Free Semigroups
inferredcites →https://doi.org/10.1090/surv/007.2openalex-snapshot
The Algebraic Theory of Semigroups, Volume II
inferredcites →https://doi.org/10.1307/mmj/1028999307openalex-snapshot
Free subsemigroups of a free 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/jsco.2001.0500openalex-snapshot
Regular Gröbner Bases
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_3openalex-snapshot
Informatique et algebre la theorie des codes a longueur variable
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_33openalex-snapshot
Kth power-free codes
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_6openalex-snapshot
Combinatorics of Words
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_8openalex-snapshot
Codes1
inferred← citeshttps://doi.org/10.1007/978-3-642-82456-2_5openalex-snapshot
Algorithms for Factorizing and Testing Subsemigroups
inferred← citeshttps://doi.org/10.1007/bf02194675openalex-snapshot
Presentations et presentations simplifiables d'un monoïde simplifiable
inferred← citeshttps://doi.org/10.1007/bf02195731openalex-snapshot
Computers in semigroups
inferred← citeshttps://doi.org/10.1007/bf02195743openalex-snapshot
On some free subsemigroups of a free semigroup
inferred← citeshttps://doi.org/10.1007/bf02572484openalex-snapshot
Some algorithms on the star operation applied to finite languages
inferred← citeshttps://doi.org/10.1007/bf02572516openalex-snapshot
On optimal factorization of free semigroups into free subsemigroups
inferred← citeshttps://doi.org/10.1007/bf02572842openalex-snapshot
Sur la classification syntaxique
inferred← citeshttps://doi.org/10.1007/bf02573193openalex-snapshot
On the defect theorem and simplifiability
inferred← citeshttps://doi.org/10.1007/bf02573619openalex-snapshot
Reidemeister-Schreier type rewriting for semigroups
inferred← citeshttps://doi.org/10.1007/bfb0030289openalex-snapshot
A note on unique decipherability
inferred← citeshttps://doi.org/10.1007/bfb0083443openalex-snapshot
Les systemes entiers d'equations sur un alphabet de 3 variables
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.1007/s10958-007-0242-yopenalex-snapshot
Profinite groups associated with weakly primitive substitutions
inferred← citeshttps://doi.org/10.1016/0020-0255(84)90027-6openalex-snapshot
Closure systems and L-subalgebras
inferred← citeshttps://doi.org/10.1016/0021-8693(79)90113-3openalex-snapshot
Sur le théorème du défaut
inferred← citeshttps://doi.org/10.1016/0022-4049(89)90043-1openalex-snapshot
Every finitely generated submonoid of a free monoid has a finite Malcev's presentation
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90137-9openalex-snapshot
Systèmes entiers d'équations sur un alphabet fini et conjecture d'ehrenfeucht
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90286-0openalex-snapshot
A bijection between cliques in graphs and factorizations in free monoids
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/s0079-8169(08)61773-0openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00101-4openalex-snapshot
The homomorphism problem for trace monoids
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.1051/ita:2000106openalex-snapshot
On codes with finite interpreting delay: a defect theorem
inferred← citeshttps://doi.org/10.1109/18.532902openalex-snapshot
The finest homophonic partition and related code concepts
inferred← citeshttps://doi.org/10.1109/18.930915openalex-snapshot
On unique, multiset, and set decipherability of three-word codes
inferred← citeshttps://doi.org/10.1109/tit.1979.1056005openalex-snapshot
A note on uniquely decipherable codes (Corresp.)
inferred← citeshttps://doi.org/10.1109/tit.1982.1056476openalex-snapshot
A decision procedure for finite decipherability and synchronizability of multivalued encodings
inferred← citeshttps://doi.org/10.1145/298514.298553openalex-snapshot
Semigroup techniques in recursive query optimization
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.