On the public citation graph

The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable

0 signed · 51 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.1006/inco.2000.2894openalex-snapshot
Pushdown Processes: Games and Model-Checking
inferredcites →https://doi.org/10.1007/10722167_7openalex-snapshot
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
inferredcites →https://doi.org/10.1007/11523468_117openalex-snapshot
Unsafe Grammars and Panic Automata
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-45413-6_21openalex-snapshot
Deciding Monadic Theories of Hyperalgebraic Trees
inferredcites →https://doi.org/10.1007/3-540-45931-6_15openalex-snapshot
Higher-Order Pushdown Trees Are Easy
inferredcites →https://doi.org/10.1007/3-540-61440-0_128openalex-snapshot
On infinite transition graphs having a decidable monadic theory
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_2openalex-snapshot
Theories for the Global Ubiquitous Computer
inferredcites →https://doi.org/10.1007/978-3-540-31982-5_31openalex-snapshot
Safety Is not a Restriction at Level 2 for String Languages
inferredcites →https://doi.org/10.1007/bfb0055090openalex-snapshot
Reasoning about the past with two-way automata
inferredcites →https://doi.org/10.1016/0304-3975(87)90133-2openalex-snapshot
Alternating automata on infinite trees
inferredcites →https://doi.org/10.1016/0304-3975(95)00049-3openalex-snapshot
The monadic second-order logic of graphs IX: Machines and their behaviours
inferredcites →https://doi.org/10.1016/s0304-3975(96)00171-5openalex-snapshot
Infinitary lambda calculus
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1090/tranopenalex-snapshot
Transactions of the American Mathematical Society
inferredcites →https://doi.org/10.1109/lics.1994.316048openalex-snapshot
Paths in the lambda-calculus. Three years of communications without understanding

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11523468_117openalex-snapshot
Unsafe Grammars and Panic Automata
inferred← citeshttps://doi.org/10.1007/11590156_5openalex-snapshot
From Logic to Games
inferred← citeshttps://doi.org/10.1007/11874683_2openalex-snapshot
Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/11874683_7openalex-snapshot
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_2openalex-snapshot
Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_31openalex-snapshot
Safety Is not a Restriction at Level 2 for String Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_4openalex-snapshot
Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_23openalex-snapshot
Verification of Higher-Order Computation: A Game-Semantic Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_2openalex-snapshot
Types and Recursion Schemes for Higher-Order Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-11881-4openalex-snapshot
Automata for Branching and Layered Temporal Structures : An Investigation into Regularities of Infinite Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_24openalex-snapshot
Untyped Recursion Schemes and Infinite Intersection Types
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_22openalex-snapshot
Verification of Tree-Processing Programs via Higher-Order Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_6openalex-snapshot
Simple Models for Recursive Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-33512-9_2openalex-snapshot
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_3openalex-snapshot
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
inferred← citeshttps://doi.org/10.1016/j.ic.2014.07.012openalex-snapshot
Krivine machines and higher-order schemes
inferred← citeshttps://doi.org/10.1017/s0960129513000054openalex-snapshot
Verification of tree-processing programs via higher-order mode checking
inferred← citeshttps://doi.org/10.1017/s0960129514000590openalex-snapshot
Simply typed fixpoint calculus and collapsible pushdown automata
inferred← citeshttps://doi.org/10.1109/lics.2006.38openalex-snapshot
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
inferred← citeshttps://doi.org/10.1109/lics.2009.26openalex-snapshot
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
inferred← citeshttps://doi.org/10.1109/lics.2011.15openalex-snapshot
Higher-Order Model Checking: From Theory to Practice
inferred← citeshttps://doi.org/10.1109/lics.2015.9openalex-snapshot
Higher-Order Model Checking: An Overview
inferred← citeshttps://doi.org/10.1109/lics.2017.8005120openalex-snapshot
A cartesian-closed category for higher-order model checking
inferred← citeshttps://doi.org/10.1111/1365-2745.13246openalex-snapshot
Colonization resistance and establishment success along gradients of functional and phylogenetic diversity in experimental plant communities
inferred← citeshttps://doi.org/10.1145/1480881.1480933openalex-snapshot
Types and higher-order recursion schemes for verification of higher-order programs
inferred← citeshttps://doi.org/10.1145/1594834.1480933openalex-snapshot
Types and higher-order recursion schemes for verification of higher-order programs
inferred← citeshttps://doi.org/10.1145/1599410.1599415openalex-snapshot
Model-checking higher-order functions
inferred← citeshttps://doi.org/10.1145/1706299.1706355openalex-snapshot
Higher-order multi-parameter tree transducers and recursion schemes for program verification
inferred← citeshttps://doi.org/10.1145/1707801.1706355openalex-snapshot
Higher-order multi-parameter tree transducers and recursion schemes for program verification
inferred← citeshttps://doi.org/10.1145/2487241.2487246openalex-snapshot
Model Checking Higher-Order Programs
inferred← citeshttps://doi.org/10.1145/2603088.2603127openalex-snapshot
Abstract interpretation from Büchi automata
inferred← citeshttps://doi.org/10.1145/3373718.3394733openalex-snapshot
A tale of intersection types
inferred← citeshttps://doi.org/10.2168/lmcs-3(3:1)2007openalex-snapshot
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.103openalex-snapshot
Evaluation is MSOL-compatible
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.603openalex-snapshot
Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown 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.