On the public citation graph

Ordering and Locally Testable Languages: a Wheeler Perspective

0 signed · 6 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.1016/j.ic.2021.104820openalex-snapshot

Wheeler languages

inferredcites →https://doi.org/10.1016/j.tcs.2025.115631openalex-snapshot

Completing Wheeler Automata

inferredcites →https://doi.org/10.1016/s0012-365x(73)80005-6openalex-snapshot

Characterizations of locally testable events

inferredcites →https://doi.org/10.1016/s0304-3975(98)00332-6openalex-snapshot

Families of locally testable languages

inferredcites →https://doi.org/10.1017/cbo9781139195218openalex-snapshot

Elements of Automata Theory

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

Co-lexicographically Ordering Automata and Regular Languages - Part I

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.