On the public citation graph

The expressive power of transitive closure and 2-way multihead automata

https://doi.org/10.1007/bfb0023754
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.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/3-540-08442-8_71openalex-snapshot
Automata in Labyrinths
inferredcites →https://doi.org/10.1007/3-540-13331-3_51openalex-snapshot
Reduction to NP-complete problems by interpretations
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/bf00263746openalex-snapshot
Transformational methods and their application to complexity problems
inferredcites →https://doi.org/10.1007/bfb0015929openalex-snapshot
A survey of two-dimensional automata theory
inferredcites →https://doi.org/10.1016/0022-0000(82)90016-2openalex-snapshot
Classifying regular events in symbolic logic
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/s0019-9958(77)90443-0openalex-snapshot
Application of model theoretic games to discrete linear orders and finite automata
inferredcites →https://doi.org/10.1016/s0022-0000(73)80048-0openalex-snapshot
On two-way multihead automata
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite 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/11672142_39openalex-snapshot
Nested Pebbles and Transitive Closure
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_46openalex-snapshot
On the Power of Tree-Walking Automata
inferred← citeshttps://doi.org/10.1007/978-94-017-0522-6_10openalex-snapshot
Computable Quantifiers and Logics over Finite Structures
inferred← citeshttps://doi.org/10.1007/bfb0023863openalex-snapshot
The Ehrenfeucht-Fraïssé games for transitive closure
inferred← citeshttps://doi.org/10.1007/s11168-009-9060-3openalex-snapshot
Monadic Second-Order Logic and Transitive Closure Logics Over Trees
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00113-1openalex-snapshot
Monadic partition logics and finite automata
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.044openalex-snapshot
Monadic Second-Order Logic and Transitive Closure Logics over Trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.041openalex-snapshot
Classifying regular languages by a split game
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.024openalex-snapshot
Characterizing weighted MSO for trees by branching transitive closure logics
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00013-0openalex-snapshot
On the power of tree-walking automata
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80022-xopenalex-snapshot
19 Applications of modal logic in linguistics
inferred← citeshttps://doi.org/10.1023/a:1023027932419openalex-snapshot
Complexity of Two-Dimensional Patterns
inferred← citeshttps://doi.org/10.2168/lmcs-3(2:3)2007openalex-snapshot
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
inferred← citeshttps://doi.org/10.48550/arxiv.cond-mat/9804071openalex-snapshot
Complexity of Two-Dimensional Patterns
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.