On the public citation graph

A note on intersections of free submonoids of a free monoid

https://doi.org/10.1007/bf02573324
0 signed · 17 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.1016/0021-8693(79)90113-3openalex-snapshot
Sur le théorème du défaut
inferredcites →https://doi.org/10.1016/0021-8693(83)90119-9openalex-snapshot
On binary equality sets and a solution to the test set conjecture in the binary case
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/s0019-9958(77)90050-xopenalex-snapshot
Automata that recognize intersections of free submonoids

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_17openalex-snapshot
Binary Intersection Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_3openalex-snapshot
On Sets of Words of Rank Two
inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_3openalex-snapshot
Iterated Substitutions and Locally Catenative Systems: a Decidability Result in the Binary Case
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_6openalex-snapshot
Combinatorics of Words
inferred← citeshttps://doi.org/10.1007/bf02573193openalex-snapshot
On the defect theorem and simplifiability
inferred← citeshttps://doi.org/10.1007/bfb0032053openalex-snapshot
Iterated substitutions and locally catenative systems: a decidability result in the binary case
inferred← citeshttps://doi.org/10.1007/s00233-012-9449-4openalex-snapshot
A sufficient condition for the Hanna Neumann property of submonoids of a free monoid
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.002openalex-snapshot
Binary intersection formalized
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.003openalex-snapshot
Primitive sets of words
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.11.024openalex-snapshot
The intersection of 3-maximal submonoids
inferred← citeshttps://doi.org/10.1051/ita:2008014openalex-snapshot
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.120openalex-snapshot
The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms
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.