On the public citation graph

Some properties of space-bounded synchronized alternating turing machines with only universal states

https://doi.org/10.1007/bfb0015931
0 signed · 26 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.1007/3-540-10843-2_40openalex-snapshot
Alternating multihead finite automata
inferredcites →https://doi.org/10.1007/3-540-16761-7_65openalex-snapshot
Tradeoffs for language recognition on parallel computing models
inferredcites →https://doi.org/10.1007/bf00264255openalex-snapshot
On alternation
inferredcites →https://doi.org/10.1007/bf00286494openalex-snapshot
On alternation II
inferredcites →https://doi.org/10.1007/bf01786980openalex-snapshot
(Semi)alternating stack automata
inferredcites →https://doi.org/10.1007/bfb0017175openalex-snapshot
On the power of communication in alternating machines
inferredcites →https://doi.org/10.1016/0020-0190(85)90100-0openalex-snapshot
Alternating multicounter machines with constant number of reversals
inferredcites →https://doi.org/10.1016/0020-0255(85)90042-8openalex-snapshot
A space-hierarchy result on two-dimensional alternating Turing machines with only universal states
inferredcites →https://doi.org/10.1016/0022-0000(85)90063-7openalex-snapshot
On the power of alternation in automata theory
inferredcites →https://doi.org/10.1016/0304-3975(85)90048-9openalex-snapshot
Alternating simple multihead finite automata
inferredcites →https://doi.org/10.1016/0304-3975(85)90080-5openalex-snapshot
Alternating on-line turing machines with only universal states and small space bounds
inferredcites →https://doi.org/10.1016/0304-3975(88)90122-3openalex-snapshot
Alternating multihead finite automata
inferredcites →https://doi.org/10.1016/s0019-9958(82)90572-1openalex-snapshot
Two-dimensional alternating turing machines with only universal states
inferredcites →https://doi.org/10.1137/0213010openalex-snapshot
Alternating Pushdown and Stack Automata
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-51486-4_67openalex-snapshot
On the power of synchronization in parallel computations
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_69openalex-snapshot
On space-bounded synchronized alternating turing machines
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_69openalex-snapshot
New results concerning synchronized finite automata
inferred← citeshttps://doi.org/10.1007/bf01178509openalex-snapshot
On communication-bounded synchronized alternating finite automata
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90099-jopenalex-snapshot
One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90098-hopenalex-snapshot
On the power of synchronization in parallel computations
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90346-hopenalex-snapshot
Some properties of space-bounded synchronized alternating Turing machines with universal states only
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/0304-3975(93)90119-eopenalex-snapshot
Synchronized finite automata and 2DFA reductions
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/0304-3975(94)90238-0openalex-snapshot
Deterministic versus nondeterministic space in terms of synchronized alternating machines
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.