On the public citation graph

On the deficit of a finite set of words

https://doi.org/10.1007/bf02573374
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.1007/bf02573193openalex-snapshot
On the defect theorem and simplifiability
inferredcites →https://doi.org/10.1016/0020-0190(84)90020-6openalex-snapshot
Pattern Matching Machine implementation of a fast test for unique decipherability
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/0304-3975(81)90104-3openalex-snapshot
Sur la determination du rang d'une equation dans le monoide libre
inferredcites →https://doi.org/10.1016/s0019-9958(77)90512-5openalex-snapshot
The decidability of the equivalence problem for DOL-systems
inferredcites →https://doi.org/10.1070/sm1977v032n02abeh002376openalex-snapshot
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1109/tit.1963.1057817openalex-snapshot
Tests for unique decipherability
inferredcites →https://doi.org/10.1109/tit.1982.1056535openalex-snapshot
A fast test for unique decipherability based on suffix trees (Corresp.)
inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot
SEMIGROUPS AND COMBINATORIAL APPLICATIONS
inferredcites →https://doi.org/10.1112/blms/6.2.218bopenalex-snapshot
GRAPHS AND HYPERGRAPHS
inferredcites →https://doi.org/10.7146/dpb.v3i33.6453openalex-snapshot
The Mathematical Theory of L Systems

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-52590-4_44openalex-snapshot
Unitary monoid with two generators: An algorithmic point of view
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_80openalex-snapshot
On the subsets of rank two in a free monoid: A fast decision algorithm
inferred← citeshttps://doi.org/10.1007/3-540-56730-5_38openalex-snapshot
On the subsets of rank two in a free monoid: A fast decision algorithm
inferred← citeshttps://doi.org/10.1007/978-94-011-5020-0_28openalex-snapshot
The Fibonacci Pyramid
inferred← citeshttps://doi.org/10.1007/bf02574119openalex-snapshot
The monoid of ordered partitions of a natural number
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90140-bopenalex-snapshot
A string-matching interpretation of the equation xmyn = zp
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90350-oopenalex-snapshot
On the rank of the subsets of a free monoid
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90023-mopenalex-snapshot
Deciding whether a finite set of words has rank at most two
inferred← citeshttps://doi.org/10.1017/s0305004100075964openalex-snapshot
Combinatorial results for semigroups of order-preserving mappings
inferred← citeshttps://doi.org/10.25596/jalc-2002-377openalex-snapshot
On the Combinatorial Alphabets of a Language
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.