On the public citation graph

Nondeterministic Automatic Complexity of Overlap-Free and Almost Square-Free Words

https://doi.org/10.37236/4851
0 signed · 20 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/978-0-387-68441-3openalex-snapshot
Algorithmic Randomness and Complexity
inferredcites →https://doi.org/10.1016/0012-365x(85)90065-2openalex-snapshot
Chains and fixing blocks in irreducible binary sequences
inferredcites →https://doi.org/10.1016/j.jnt.2011.02.006openalex-snapshot
Thue–Morse at multiples of an integer
inferredcites →https://doi.org/10.1016/j.tcs.2011.06.021openalex-snapshot
Finite state complexity
inferredcites →https://doi.org/10.1017/cbo9780511808876openalex-snapshot
A Second Course in Formal Languages and Automata Theory
inferredcites →https://doi.org/10.25596/jalc-2001-537openalex-snapshot
Automatic Complexity of Strings
inferredcites →https://doi.org/10.37236/1196openalex-snapshot
How Many Squares Must a Binary Sequence Contain?
inferredcites →https://doi.org/10.4064/aa-13-3-259-265openalex-snapshot
Sur les nombres qui ont des propriétés additives et multiplicatives données

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-031-49190-0_2openalex-snapshot
Conditional Automatic Complexity and Its Metrics
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_6openalex-snapshot
The Complexity of Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-58187-3_12openalex-snapshot
Superposition as Memory: Unlocking Quantum Automatic Complexity
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_33openalex-snapshot
Automatic Kolmogorov Complexity and Normality Revisited
inferred← citeshttps://doi.org/10.1007/s00224-017-9795-4openalex-snapshot
On the Complexity of Automatic Complexity
inferred← citeshttps://doi.org/10.1007/s10472-021-09769-9openalex-snapshot
VC-dimensions of nondeterministic finite automata for words of equal length
inferred← citeshttps://doi.org/10.1016/j.dam.2020.10.014openalex-snapshot
Automatic complexity of Fibonacci and Tribonacci words
inferred← citeshttps://doi.org/10.1016/j.disc.2018.05.015openalex-snapshot
Automatic complexity of shift register sequences
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.12.003openalex-snapshot
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
inferred← citeshttps://doi.org/10.1017/fms.2021.58openalex-snapshot
An incompressibility theorem for automatic complexity
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2021.47openalex-snapshot
Normal Sequences with Non-Maximal Automatic Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1701.09060openalex-snapshot
Automatic Kolmogorov complexity, normality and finite state dimension revisited
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.