On the public citation graph

Canonical systems which produce periodic sets

https://doi.org/10.1007/bf01705888
0 signed · 15 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/bf01969548openalex-snapshot
Regular canonical systems
inferredcites →https://doi.org/10.1109/tit.1956.1056813openalex-snapshot
Three models for the description of language
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.2307/2371809openalex-snapshot
Formal Reductions of the General Combinatorial Decision Problem

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-18170-9_178openalex-snapshot
Grammars for terms and automata
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_27openalex-snapshot
Deleting String Rewriting Systems Preserve Regularity
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_13openalex-snapshot
The Work of J. Richard Büchi
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_68openalex-snapshot
Extraction and Implication of Path Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_6openalex-snapshot
On Bifix Systems and Generalizations
inferred← citeshttps://doi.org/10.1007/bf02280809openalex-snapshot
Combinatorial systems defined over one- and two-letter alphabets
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.009openalex-snapshot
Deleting string rewriting systems preserve regularity
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.051openalex-snapshot
Computing by commuting
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.010openalex-snapshot
Path constraints in semistructured data
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70326-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1051/ita:2005024openalex-snapshot
Complexity results for prefix grammars
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.