On the public citation graph

Minimal forbidden words and factor automata

0 signed · 17 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-60922-9_45openalex-snapshot

Minimal forbidden words and symbolic dynamics

inferredcites →https://doi.org/10.1007/978-3-662-07675-0_10openalex-snapshot

Symbolic Dynamics and Finite Automata

inferredcites →https://doi.org/10.1007/978-3-662-07675-0_9openalex-snapshot

Automata for Matching Patterns

inferredcites →https://doi.org/10.1016/0020-0190(94)90008-6openalex-snapshot

On bispecial factors of the Thue–Morse word

inferredcites →https://doi.org/10.1016/0304-3975(94)00035-hopenalex-snapshot

Some combinatorial properties of Sturmian words

inferredcites →https://doi.org/10.1145/360825.360855openalex-snapshot

Efficient string matching

inferredcites →https://doi.org/10.36045/bbms/1105730624openalex-snapshot

Complexité et facteurs spéciaux

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-47849-3_18openalex-snapshot

Factor Oracle: A New Structure for Pattern Matching

inferred← citeshttps://doi.org/10.1007/3-540-48452-3_3openalex-snapshot

Pattern Matching in Text Compressed by Using Antidictionaries

inferred← citeshttps://doi.org/10.1007/3-540-48523-6_23openalex-snapshot

Text Compression Using Antidictionaries

inferred← citeshttps://doi.org/10.1007/978-1-4471-0551-0_13openalex-snapshot

On Bispecial Words and Subword Complexity of DOL Sequences *

inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_6openalex-snapshot

String Pattern Matching for a Deluge Survival Kit

inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_35openalex-snapshot

A Characterization of Bispecial Sturmian Words

inferred← citeshttps://doi.org/10.1007/bfb0055753openalex-snapshot

Mathematical Foundations of Computer Science 1998

inferred← citeshttps://doi.org/10.1007/s00023-026-01728-6openalex-snapshot

Growth in Matrix Algebras and a Conjecture of Pérez-García, Verstraete, Wolf and Cirac

inferred← citeshttps://doi.org/10.1016/j.jcss.2013.11.001openalex-snapshot

On the structure of bispecial Sturmian words

inferred← citeshttps://doi.org/10.1109/5.892711openalex-snapshot

Data compression using antidictionaries

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.