On the public citation graph
Two memory bounds for the recognition of primes by automata
0 signed · 19 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.1016/s0022-0000(68)80038-8openalex-snapshot
On a characterization of the nonregular set of primes
inferredcites →https://doi.org/10.1093/qmath/os-8.1.255openalex-snapshot
ON THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES
inferredcites →https://doi.org/10.1145/321450.321461openalex-snapshot
A Remark on Acceptable Sets of Numbers
inferredcites →https://doi.org/10.1145/321466.321470openalex-snapshot
On the Recognition of Primes by Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1996.0046openalex-snapshot
Automaticity I: Properties of a Measure of Descriptional Complexity
inferred← citeshttps://doi.org/10.1007/3-540-48057-9_4openalex-snapshot
Minimal Cover-Automata for Finite Languages
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_3openalex-snapshot
Juris Hartmanis: Building a Department—Building a Discipline
inferred← citeshttps://doi.org/10.1007/978-3-662-40087-6_1openalex-snapshot
On the Structure of Feasible Computations
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90032-0openalex-snapshot
Space complexity in on-line computation
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90024-4openalex-snapshot
On tape bounds for single letter alphabet language processing
inferred← citeshttps://doi.org/10.1016/b978-0-12-417750-5.50006-3openalex-snapshot
COMPUTATIONALLY COMPLEX AND PSEUDO-RANDOM ZERO-ONE VALUED FUNCTIONS††Portions of this work were carried out at Carngie-Mellon University, while the authors were in the Department of Computer Science. Portions of these results were reported in preliminary form in [1].
inferred← citeshttps://doi.org/10.1016/s0022-0000(68)80038-8openalex-snapshot
On a characterization of the nonregular set of primes
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60449-0openalex-snapshot
On the Structure of Feasible Computations
inferred← citeshttps://doi.org/10.1093/logcom/exaa007openalex-snapshot
Lower bounds for the state complexity of probabilistic languages and the language of prime numbers
inferred← citeshttps://doi.org/10.1109/sfcs.1975.2openalex-snapshot
A note on tape bounds for sla language processing
inferred← citeshttps://doi.org/10.1145/3209108.3209167openalex-snapshot
The State Complexity of Alternating Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1607.00259openalex-snapshot
Lower Bounds for Alternating Online State Complexity
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.