On the public citation graph
Closure of Language Classes Under Bounded Duplication
0 signed · 25 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-3-540-24635-0_22openalex-snapshot
Formal Languages Arising from Gene Repeated Duplication
inferredcites →https://doi.org/10.1007/978-3-662-03563-4_4openalex-snapshot
Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/j.dam.2004.10.003openalex-snapshot
Uniformly bounded duplication languages
inferredcites →https://doi.org/10.1051/ita:2007021openalex-snapshot
Uniformly bounded duplication codes
inferredcites →https://doi.org/10.37236/1671openalex-snapshot
There Are Ternary Circular Square-Free Words of Length $n$ for $n\ge 18$
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-030-14812-6_29openalex-snapshot
Watson-Crick Jumping Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_6openalex-snapshot
Tandem Duplications, Segmental Duplications and Deletions, and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_13openalex-snapshot
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-319-21819-9_11openalex-snapshot
Duplications and Pseudo-Duplications
inferred← citeshttps://doi.org/10.1007/978-3-319-58187-3_15openalex-snapshot
Deduplication on Finite Automata and Nested Duplication Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_33openalex-snapshot
Duplication in DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_32openalex-snapshot
On Regularity-Preservation by String-Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-88869-7_4openalex-snapshot
Duplication in DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-981-19-7014-6_10openalex-snapshot
Note on Distributivity of Different String Operations Over Language Sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.008openalex-snapshot
Non-overlapping inversion on strings and languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.12.005openalex-snapshot
Prefix–suffix square reduction
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.06.018openalex-snapshot
Bound-decreasing duplication system
inferred← citeshttps://doi.org/10.1142/s012905411640013xopenalex-snapshot
General Idempotency Languages Over Small Alphabets
inferred← citeshttps://doi.org/10.1142/s0129054120400067openalex-snapshot
On the Prefix–Suffix Duplication Reduction
inferred← citeshttps://doi.org/10.1142/s0129054120500331openalex-snapshot
Watson–Crick Jumping Finite Automata
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
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.