On the public citation graph
Real-time computations with restricted nondeterminism
0 signed · 43 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-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1016/s0019-9958(64)90120-2openalex-snapshot
Classes of languages and linear-bounded automata
inferredcites →https://doi.org/10.1016/s0019-9958(66)80003-7openalex-snapshot
Turing machines with restricted memory access
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1109/tec.1962.5219459openalex-snapshot
Real-Time Computation and Recursive Functions Not Real-Time Computable
inferredcites →https://doi.org/10.1145/321724.321726openalex-snapshot
Real-Time Simulation of Multihead Tape Units
inferredcites →https://doi.org/10.1145/800105.803407openalex-snapshot
Computations with a restricted number of nondeterministic steps (Extended Abstract)
inferredcites →https://doi.org/10.1145/800105.803414openalex-snapshot
New real-time simulations of multihead tape units
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11779148_13openalex-snapshot
Context-Dependent Nondeterminism for Pushdown Automata
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_98openalex-snapshot
Another hierarchy defined by multihead finite automata
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_33openalex-snapshot
The emptiness problem for intersections of regular languages
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_54openalex-snapshot
Cellular Automata and Language Theory
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_25openalex-snapshot
Cellular Automata and Language Theory
inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_54openalex-snapshot
Cellular Automata and Language Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-20981-0_6openalex-snapshot
Iterative Arrays with Self-verifying Communication Cell
inferred← citeshttps://doi.org/10.1007/978-3-319-18812-6_1openalex-snapshot
Complexity of One-Way Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-99813-8_31openalex-snapshot
Self-verifying Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-76336-9_10openalex-snapshot
Regulated Nondeterminism in Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-15349-5_1openalex-snapshot
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-47221-7_11openalex-snapshot
Shrinking One-Way Cellular Automata
inferred← citeshttps://doi.org/10.1007/bf02945517openalex-snapshot
The polynomially exponential time restrained analytical hierarchy
inferred← citeshttps://doi.org/10.1007/s11047-016-9588-8openalex-snapshot
Shrinking one-way cellular automata
inferred← citeshttps://doi.org/10.1007/s11047-020-09812-4openalex-snapshot
Iterative arrays with self-verifying communication cell
inferred← citeshttps://doi.org/10.1016/0304-3975(92)00014-iopenalex-snapshot
Nondeterministic circuits, space complexity and quasigroups
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.04.009openalex-snapshot
On multi-head automata with restricted nondeterminism
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.04.001openalex-snapshot
Measuring nondeterminism in pushdown automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.01.015openalex-snapshot
Context-dependent nondeterminism for pushdown automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.002openalex-snapshot
Regulated nondeterminism in pushdown automata
inferred← citeshttps://doi.org/10.1080/03081079.2012.695896openalex-snapshot
Non-deterministic cellular automata and languages
inferred← citeshttps://doi.org/10.1109/itng.2011.167openalex-snapshot
Sublinear Space Real-Time Turing Machines Cannot Count
inferred← citeshttps://doi.org/10.1109/mahc.1981.10006openalex-snapshot
Formal Languages: Origins and Directions
inferred← citeshttps://doi.org/10.1109/sfcs.1979.19openalex-snapshot
Formal languages: Origins and directions
inferred← citeshttps://doi.org/10.1142/9789812704979_0006openalex-snapshot
ITERATIVE ARRAYS WITH LIMITED NONDETERMINISTIC COMMUNICATION CELL
inferred← citeshttps://doi.org/10.1142/s0129054112400011openalex-snapshot
IN MEMORIAM CHANDRA KINTALA
inferred← citeshttps://doi.org/10.22029/jlupub-6977openalex-snapshot
Refining Nondeterminism Below Linear Time
inferred← citeshttps://doi.org/10.3103/s1066369x14090096openalex-snapshot
Computational power of one-way turing machines with sublogarithmic memory restrictions
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.