On the public citation graph
Une Topologie du Monoïde Libre
0 signed · 47 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/bf02194775openalex-snapshot
On certain codes admitting inverse semigroups as syntactic monoids
inferredcites →https://doi.org/10.1016/0304-3975(76)90026-8openalex-snapshot
Sur les relations rationnelles entre monoides libres
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1090/s0002-9947-1949-0032642-4openalex-snapshot
Coset Representations in Free Groups
inferredcites →https://doi.org/10.2307/1969513openalex-snapshot
A Topology for Free Groups and Related Groups
inferredcites →https://doi.org/10.4064/aa-30-1-5-17openalex-snapshot
Factorisation de fractions rationnelles et de suites récurrentes
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-13345-3_30openalex-snapshot
Languages and inverse semigroups
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_19openalex-snapshot
On the languages accepted by finite reversible automata
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_87openalex-snapshot
Polynomial closure of group languages and open sets of the Hall topology
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_87openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_169openalex-snapshot
Finite loops recognize exactly the regular open languages
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_35openalex-snapshot
Identifiability of subspaces and homomorphic images of zero-reversible languages
inferred← citeshttps://doi.org/10.1007/978-3-030-55215-2_4openalex-snapshot
Free Profinite Monoids, Semigroups and Groups
inferred← citeshttps://doi.org/10.1007/978-94-009-3839-7_13openalex-snapshot
Some Decision Problems for Inverse Monoid Presentations
inferred← citeshttps://doi.org/10.1007/bf02572788openalex-snapshot
Sur mon article “une topologie du monoide libre”
inferred← citeshttps://doi.org/10.1007/bf02573247openalex-snapshot
On recognition and compactification
inferred← citeshttps://doi.org/10.1007/bf02573412openalex-snapshot
Retracts of free monoids are nowhere dense with respect to finite group topologies and p-adic topologies
inferred← citeshttps://doi.org/10.1007/bf02679467openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/bfb0015770openalex-snapshot
Finite group topology and p-adic topology for free monoids
inferred← citeshttps://doi.org/10.1007/s00233-017-9886-1openalex-snapshot
Inverse subsemigroups of finite index in finitely generated inverse semigroups
inferred← citeshttps://doi.org/10.1007/s00605-014-0721-4openalex-snapshot
Acyclic, connected and tree sets
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90302-6openalex-snapshot
Thue-Morse sequence and p-adic topology for the free monoid
inferred← citeshttps://doi.org/10.1016/0021-8693(87)90048-2openalex-snapshot
Inverse semigroups and varieties of finite semigroups
inferred← citeshttps://doi.org/10.1016/0021-8693(91)90094-oopenalex-snapshot
Topologies for the free monoid
inferred← citeshttps://doi.org/10.1016/0022-4049(90)90057-oopenalex-snapshot
Presentations of inverse monoids
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90031-8openalex-snapshot
Biprefix codes, inverse semigroups and syntactic monoids of injective automata
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90085-6openalex-snapshot
On the syntactic transformation semigroup of a language generated by a finite biprefix code
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90121-uopenalex-snapshot
On a conjecture concerning dot-depth two languages
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2012.07.013openalex-snapshot
Bifix codes and Sturmian words
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.011openalex-snapshot
A palindromization map for the free group
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00120-xopenalex-snapshot
Polynomial closure of group languages and open sets of the Hall topology
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00224-1openalex-snapshot
Learning approximately regular languages with reversible languages
inferred← citeshttps://doi.org/10.1017/s0004972700027805openalex-snapshot
A topological approach to a conjecture of Rhodes
inferred← citeshttps://doi.org/10.1051/ita/1991250100391openalex-snapshot
On equality sets of morphisms in topological free monoids
inferred← citeshttps://doi.org/10.1080/00207160500113561openalex-snapshot
Retractions and retracts of free topological monoids
inferred← citeshttps://doi.org/10.1112/blms/23.4.356openalex-snapshot
A Conjecture on the Hall Topology for the Free Group
inferred← citeshttps://doi.org/10.1142/s0218196715400123openalex-snapshot
Inverse monoids and immersions of 2-Complexes
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1856openalex-snapshot
Profinite Methods in Automata Theory
inferred← citeshttps://doi.org/10.70675/ec6896efz3abdz4ab1z88d4z575bc710070dopenalex-snapshot
Iterated morphisms, combinatorics on words and symbolic dynamical systems
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.