On the public citation graph
Multi-stack-counter languages
0 signed · 24 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/bf01694011openalex-snapshot
Counter machines and counter languages
inferredcites →https://doi.org/10.1016/s0019-9958(66)80003-7openalex-snapshot
Turing machines with restricted memory access
inferredcites →https://doi.org/10.1016/s0019-9958(70)80035-3openalex-snapshot
On the closure of AFL under reversal
inferredcites →https://doi.org/10.1016/s0022-0000(69)80015-2openalex-snapshot
Scattered context grammars
inferredcites →https://doi.org/10.1090/memo/0087openalex-snapshot
Studies in abstract families of languages
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1145/800169.805419openalex-snapshot
Intercalation theorems for stack languages
inferredcites →https://doi.org/10.2307/1970290openalex-snapshot
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-95289-0_6openalex-snapshot
Zur Analysenkomplexitaet von Grammatiken und Pushdown-Akzeptoren, die Hilfszaehler Verwenden
inferred← citeshttps://doi.org/10.1007/bf00262976openalex-snapshot
A hierarchy theorem for multihead stack-counter automata
inferred← citeshttps://doi.org/10.1007/s00236-025-00488-wopenalex-snapshot
Deterministic real-time tree-walking-storage automata
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90005-7openalex-snapshot
One-way weak-stack-counter automata
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90086-xopenalex-snapshot
Two-way deterministic multi-weak-counter machines
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90378-fopenalex-snapshot
A note on real-time one-way alternating multicounter machines
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90203-6openalex-snapshot
A note on realtime one-way synchronized alternating one-counter automata
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104768openalex-snapshot
Cayley polynomial–time computable groups
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2014.04.021openalex-snapshot
C -graph automatic groups
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80058-9openalex-snapshot
The equivalence of stack-counter acceptors and quasi-realtime stack-counter acceptors
inferred← citeshttps://doi.org/10.1016/s0022-0000(75)80048-1openalex-snapshot
Proving containment of bounded AFL
inferred← citeshttps://doi.org/10.1109/sfcs.1976.35openalex-snapshot
Variations of a new machine model
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.