On the public citation graph

Sur un algorithme donnant les codes bipréfixes finis

https://doi.org/10.1007/bf01706090
0 signed · 28 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.1214/aoms/1177704860openalex-snapshot
On a Special Class of Recurrent Events
inferredcites →https://doi.org/10.24033/bsmf.1623openalex-snapshot
Sur certains sous-monoïdes libres

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-12727-5_6openalex-snapshot
Prefix and perfect languages
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_58openalex-snapshot
Finite biprefix sets of paths in a Graph
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_25openalex-snapshot
Factorizing Codes and Schützenberger Conjectures
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_211openalex-snapshot
On the factorization conjecture
inferred← citeshttps://doi.org/10.1007/bf01214481openalex-snapshot
La transitivite du groupe d'un code biprefixe fini
inferred← citeshttps://doi.org/10.1007/bf02194921openalex-snapshot
Sur Le Produit De Concatenation Non Ambigu
inferred← citeshttps://doi.org/10.1007/bfb0028819openalex-snapshot
Recent results on codes
inferred← citeshttps://doi.org/10.1007/bfb0087131openalex-snapshot
La representation ergodique des codes biprefixes
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90291-zopenalex-snapshot
A partial result about the factorization conjecture for finite variable-length codes
inferred← citeshttps://doi.org/10.1016/0097-3165(78)90078-xopenalex-snapshot
Le degré minimal du groupe d'un code bipréfixe fini
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90026-4openalex-snapshot
La representation ergodique d'un automate fini
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90021-7openalex-snapshot
Finite biprefix sets of paths in a graph
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.2018.08.022openalex-snapshot
Embedding a θ-invariant code into a complete one
inferred← citeshttps://doi.org/10.1016/s0012-365x(81)80022-2openalex-snapshot
A graph covering construction of all the finite complete biprefix codes
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90546-6openalex-snapshot
A combinatorial property of finite prefix codes
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90568-4openalex-snapshot
Team tournaments and finite elementary codes
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)61773-0openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00277-2openalex-snapshot
Finite maximal solid codes
inferred← citeshttps://doi.org/10.1051/ita/1985190201651openalex-snapshot
Construction de codes indécomposables
inferred← citeshttps://doi.org/10.1051/ita/1988220303111openalex-snapshot
A property of biprefix codes
inferred← citeshttps://doi.org/10.1051/ita:2005040openalex-snapshot
On a complete set of operations for factorizing codes
inferred← citeshttps://doi.org/10.1109/18.904513openalex-snapshot
Some basic properties of fix-free codes
inferred← citeshttps://doi.org/10.1109/tit.2022.3218212openalex-snapshot
The 3/4 Conjecture for Fix-Free Codes With at Most Three Distinct Codeword Lengths
inferred← citeshttps://doi.org/10.1142/9789812703118_0010openalex-snapshot
Maximal Independent Sets in Certain Subword Orders
inferred← citeshttps://doi.org/10.70675/ad640699zca25z428cz9ed9z609ebd0f37c4openalex-snapshot
Étude de la dynamique symbolique des développements en base négative, système de Lyndon
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.