On the public citation graph
Hi�rarchie et fermeture de certaines classes de tag-syst�mes
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.
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.1007/978-1-4615-8249-6_4openalex-snapshot
The Mathematical Theory of L Systems
inferredcites →https://doi.org/10.1016/0012-365x(80)90151-xopenalex-snapshot
Mots sans carre et morphismes iteres
inferredcites →https://doi.org/10.1016/0020-0190(81)90004-1openalex-snapshot
The morse sequence and iterated morphisms
inferredcites →https://doi.org/10.1016/0097-3165(74)90041-7openalex-snapshot
On nonrepetitive sequences
inferredcites →https://doi.org/10.1016/0304-3975(75)90012-2openalex-snapshot
Subword complexities of various classes of deterministic developmental languages without interactions
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1051/ita/1982160403031openalex-snapshot
On subword complexities of homomorphic images of languages
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_21openalex-snapshot
Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteres
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_34openalex-snapshot
Complexité des facteurs des mots infinis engendrés par morphismes itérés
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_34openalex-snapshot
On various classes of infinite words obtained by iterated mappings
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_21openalex-snapshot
Eigenvalues and Transduction of Morphic Sequences
inferred← citeshttps://doi.org/10.1007/bfb0028981openalex-snapshot
A generalization of automatic sequences
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90103-xopenalex-snapshot
A generalization of automatic sequences
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103529openalex-snapshot
Decidable problems in substitution shifts
inferred← citeshttps://doi.org/10.1016/j.laa.2016.02.030openalex-snapshot
Asymptotic properties of free monoid morphisms
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.037openalex-snapshot
On the simplification of infinite morphic words
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)84103-0openalex-snapshot
Uniform tag systems for paperfolding sequences
inferred← citeshttps://doi.org/10.1051/ita/2013035openalex-snapshot
Decidability of the HD0L ultimate periodicity problem
inferred← citeshttps://doi.org/10.48550/arxiv.1406.1754openalex-snapshot
Eigenvalues and Transduction of Morphic Sequences: Extended Version
inferred← citeshttps://doi.org/10.70675/624375d2zf6b8z4cc0z9f29z3338a2b4968bopenalex-snapshot
Dynamique topologique des extractions périodiques pour les sous-shifts substitutifs
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.