On the public citation graph

Repetitions in homomorphisms and languages

https://doi.org/10.1007/bfb0012769
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/3-540-09510-1_2openalex-snapshot
Sur les mots sans carré définis par un morphisme
inferredcites →https://doi.org/10.1007/3-540-10854-8_19openalex-snapshot
On strongly cube-free ω-words generated by binary morphisms
inferredcites →https://doi.org/10.1007/978-1-4615-8249-6_4openalex-snapshot
The Mathematical Theory of L Systems
inferredcites →https://doi.org/10.1007/bf01706087openalex-snapshot
Uniform tag sequences
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50011-7openalex-snapshot
MORPHISMS ON FREE MONOIDS AND LANGUAGE THEORY1
inferredcites →https://doi.org/10.1017/s0305004100046077openalex-snapshot
Non-repetitive sequences
inferredcites →https://doi.org/10.1215/s0012-7094-44-01101-4openalex-snapshot
Unending chess, symbolic dynamics and a problem in semigroups
inferredcites →https://doi.org/10.2140/pjm.1979.85.261openalex-snapshot
Avoidable patterns in strings of symbols
inferredcites →https://doi.org/10.5860/choice.26-3305openalex-snapshot
An introduction to formal language theory
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-12920-0_2openalex-snapshot
Some recent results on squarefree words
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_33openalex-snapshot
Kth power-free codes
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_98openalex-snapshot
If a DOL language is k-power free then it is circular
inferred← citeshttps://doi.org/10.1007/978-0-387-26677-0_6openalex-snapshot
Sequences of Integers
inferred← citeshttps://doi.org/10.1007/bfb0015759openalex-snapshot
On k-repetition free words generated by length uniform morphisms over a binary alphabet
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90033-4openalex-snapshot
On the generation of powers by OS schemes
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90213-0openalex-snapshot
A characterization of power-free morphisms
inferred← citeshttps://doi.org/10.1016/b978-0-12-198820-3.50009-7openalex-snapshot
TESTS SUR LES MORPHISMES FAIBLEMENT SANS CARRE
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.019openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1051/ita/2023006openalex-snapshot
On a Test of Square-Free Morphisms
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.