On the public citation graph

(Semi)alternating stack automata

https://doi.org/10.1007/bf01786980
0 signed · 27 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/0022-0000(80)90036-7openalex-snapshot
Tree-size bounded alternation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0022-0000(67)80013-8openalex-snapshot
Nonerasing stack automata
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1016/s0022-0000(71)80029-6openalex-snapshot
Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata
inferredcites →https://doi.org/10.1109/focs.1965.14openalex-snapshot
Memory bounds for recognition of context-free and context-sensitive languages
inferredcites →https://doi.org/10.1109/sfcs.1976.20openalex-snapshot
On parallelism in turing machines
inferredcites →https://doi.org/10.1109/sfcs.1976.4openalex-snapshot
Alternation
inferredcites →https://doi.org/10.1109/sfcs.1978.6openalex-snapshot
Alternating pushdown automata
inferredcites →https://doi.org/10.1137/0209029openalex-snapshot
Path Systems: Constructions, Solutions and Applications
inferredcites →https://doi.org/10.1145/321371.321385openalex-snapshot
Stack automata and compiling
inferredcites →https://doi.org/10.1145/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
inferredcites →https://doi.org/10.1145/800135.804428openalex-snapshot
Tree-size bounded alternation(Extended Abstract)
inferredcites →https://doi.org/10.1145/800161.805151openalex-snapshot
Path systems and language recognition

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-031-33264-7_15openalex-snapshot
Tree-Walking-Storage Automata
inferred← citeshttps://doi.org/10.1007/bfb0015931openalex-snapshot
Some properties of space-bounded synchronized alternating turing machines with only universal states
inferred← citeshttps://doi.org/10.1007/bfb0017175openalex-snapshot
On the power of communication in alternating machines
inferred← citeshttps://doi.org/10.1007/s00236-025-00488-wopenalex-snapshot
Deterministic real-time tree-walking-storage automata
inferred← citeshttps://doi.org/10.1007/s00236-026-00522-5openalex-snapshot
Deterministic tree-walking-storage automata
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90048-9openalex-snapshot
Alternating simple multihead finite automata
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90023-6openalex-snapshot
A grammatical characterization of alternating pushdown automata
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90351-fopenalex-snapshot
On space-bounded synchronized alternating Turing machines
inferred← citeshttps://doi.org/10.1016/j.ic.2012.11.005openalex-snapshot
Pushdown module checking with imperfect information
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90572-1openalex-snapshot
Two-dimensional alternating turing machines with only universal states
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00124-7openalex-snapshot
Three-dimensional alternating Turing machines with only universal states
inferred← citeshttps://doi.org/10.1137/0213010openalex-snapshot
Alternating Pushdown and Stack Automata
inferred← citeshttps://doi.org/10.4204/eptcs.388.7openalex-snapshot
Deterministic Real-Time Tree-Walking-Storage Automata
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.