On the public citation graph

La transitivite du groupe d'un code biprefixe fini

https://doi.org/10.1007/bf01214481
0 signed · 18 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/bf01706090openalex-snapshot
Sur un algorithme donnant les codes bipréfixes finis
inferredcites →https://doi.org/10.1016/0097-3165(78)90078-xopenalex-snapshot
Le degré minimal du groupe d'un code bipréfixe fini
inferredcites →https://doi.org/10.1016/c2013-0-11702-3openalex-snapshot
Finite Permutation Groups
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1214/aoms/1177704860openalex-snapshot
On a Special Class of Recurrent Events
inferredcites →https://doi.org/10.2307/2314023openalex-snapshot
Finite Permutation Groups.

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-08138-0_3openalex-snapshot
Informatique et algebre la theorie des codes a longueur variable
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_81openalex-snapshot
On the Theory of Syntactic Monoids for Rational Languages
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_6openalex-snapshot
Prefix and perfect languages
inferred← citeshttps://doi.org/10.1007/bf01752401openalex-snapshot
Sur une propriété d'itération des langages algébriques déterministes
inferred← citeshttps://doi.org/10.1007/bfb0024023openalex-snapshot
Groups, codes and unambiguous automata
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.1007/bfb0089811openalex-snapshot
A propos des groupes dans certains monoïdes syntactiques
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/s0079-8169(08)61773-0openalex-snapshot
References
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
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.