On the public citation graph
Maximal Repetitions in Written Texts: Finite Energy Hypothesis vs. Strong Hilberg Conjecture
0 signed · 44 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.1002/j.1538-7305.1951.tb01366.xopenalex-snapshot
Prediction and Entropy of Printed English
inferredcites →https://doi.org/10.1007/3-540-48321-7_31openalex-snapshot
On maximal repetitions in words
inferredcites →https://doi.org/10.1007/978-1-4419-8608-5openalex-snapshot
A First Course in Information Theory
inferredcites →https://doi.org/10.1007/s10959-012-0468-6openalex-snapshot
On Hidden Markov Processes with Infinite Excess Entropy
inferredcites →https://doi.org/10.1016/0010-0285(74)90018-8openalex-snapshot
Imitation in language development: If, when, and why
inferredcites →https://doi.org/10.1016/j.jcss.2007.09.003openalex-snapshot
Maximal repetitions in strings
inferredcites →https://doi.org/10.1016/j.spl.2009.01.016openalex-snapshot
A general definition of conditional information and its application to ergodic decomposition
inferredcites →https://doi.org/10.1016/s0304-3975(98)00248-5openalex-snapshot
On the combinatorics of finite words
inferredcites →https://doi.org/10.1016/s0378-4371(01)00444-7openalex-snapshot
Complexity through nonextensivity
inferredcites →https://doi.org/10.1063/1.1530990openalex-snapshot
Regularities unseen, randomness observed: Levels of entropy convergence
inferredcites →https://doi.org/10.1088/0305-4470/27/24/011openalex-snapshot
Conditional entropy of some automatic sequences
inferredcites →https://doi.org/10.1093/bioinformatics/15.5.426openalex-snapshot
REPuter: fast computation of maximal repeats in complete genomes.
inferredcites →https://doi.org/10.1093/bioinformatics/btr077openalex-snapshot
Topological entropy of DNA sequences
inferredcites →https://doi.org/10.1103/physreve.50.2616openalex-snapshot
Entropy of the symbolic sequence for critical circle maps
inferredcites →https://doi.org/10.1109/sffcs.1999.814634openalex-snapshot
Finding maximal repetitions in a word in linear time
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1109/tit.2011.2145170openalex-snapshot
On the Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts
inferredcites →https://doi.org/10.1109/tit.2012.2190708openalex-snapshot
Mixing, Ergodic, and Nonergodic Processes With Rapidly Growing Information Between Blocks
inferredcites →https://doi.org/10.1137/070710111openalex-snapshot
Power-Law Distributions in Empirical Data
inferredcites →https://doi.org/10.1184/r1/6586835.v1openalex-snapshot
Power-law distributions in empirical data
inferredcites →https://doi.org/10.1209/0295-5075/14/3/001openalex-snapshot
Entropy of Symbolic Sequences: The Role of Correlations
inferredcites →https://doi.org/10.1209/0295-5075/26/4/001openalex-snapshot
Entropy and Long-Range Correlations in Literary English
inferredcites →https://doi.org/10.1214/aop/1024404290openalex-snapshot
String matching bounds via coding
inferredcites →https://doi.org/10.1214/aop/1176989686openalex-snapshot
String Matching: The Ergodic Case
inferredcites →https://doi.org/10.1214/aop/1176991262openalex-snapshot
The Erdos-Renyi Strong Law for Pattern Matching with a Given Proportion of Mismatches
inferredcites →https://doi.org/10.1515/freq.1990.44.9-10.243openalex-snapshot
Der bekannte Grenzwert der redundanzfreien Information in Texten - eine Fehlinterpretation der Shannonschen Experimente?
inferredcites →https://doi.org/10.2307/2670189openalex-snapshot
Statistical Methods for Speech Recognition
inferredcites →https://doi.org/10.4018/jcini.2008070103openalex-snapshot
Scaling Behavior of Maximal Repeat Distributions in Genomic Sequences
inferredcites →https://doi.org/10.4467/20838476si.14.003.3020openalex-snapshot
Hilberg’s Conjecture : a Challenge for Machine Learning
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-319-18781-5_4openalex-snapshot
Estimation of Entropy from Subword Complexity
inferred← citeshttps://doi.org/10.1109/tit.2017.2733535openalex-snapshot
Maximal Repetition and Zero Entropy Rate
inferred← citeshttps://doi.org/10.1109/tit.2017.2734655openalex-snapshot
Regular Hilberg Processes: An Example of Processes With a Vanishing Entropy Rate
inferred← citeshttps://doi.org/10.1214/25-ecp718openalex-snapshot
Repetition and recurrence times: Dual statements and summable mixing rates
inferred← citeshttps://doi.org/10.3390/e18100364openalex-snapshot
Entropy Rate Estimates for Natural Language—A New Extrapolation of Compressed Large-Scale Corpora
inferred← citeshttps://doi.org/10.3390/e20020085openalex-snapshot
Is Natural Language a Perigraphic Process? The Theorem about Facts and Words Revisited
inferred← citeshttps://doi.org/10.3390/e20110839openalex-snapshot
Cross Entropy of Neural Language Models at Infinity—A New Bound of the Entropy Rate
inferred← citeshttps://doi.org/10.3390/e23091148openalex-snapshot
A Refutation of Finite-State Language Models through Zipf’s Law for Factual Knowledge
inferred← citeshttps://doi.org/10.3390/e27060613openalex-snapshot
Long-Range Dependence in Word Time Series: The Cosine Correlation of Embeddings
inferred← citeshttps://doi.org/10.4467/20838476si.14.003.3020openalex-snapshot
Hilberg’s Conjecture : a Challenge for Machine Learning
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.