On the public citation graph

On the Significance of the Collapse Operation

0 signed · 45 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/11523468_117openalex-snapshot
Unsafe Grammars and Panic Automata
inferredcites →https://doi.org/10.1007/3-540-45687-2_13openalex-snapshot
On Infinite Terms Having a Decidable Monadic Theory
inferredcites →https://doi.org/10.1007/3-540-45931-6_15openalex-snapshot
Higher-Order Pushdown Trees Are Easy
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_10openalex-snapshot
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata
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/978-3-642-32589-2_50openalex-snapshot
Strictness of the Collapsible Pushdown Hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(96)00244-7openalex-snapshot
A shrinking lemma for indexed languages
inferredcites →https://doi.org/10.1109/lics.2006.38openalex-snapshot
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.1109/lics.2008.34openalex-snapshot
Collapsible Pushdown Automata and Recursion Schemes
inferredcites →https://doi.org/10.1145/1599410.1599415openalex-snapshot
Model-checking higher-order functions
inferredcites →https://doi.org/10.2977/prims/1195192738openalex-snapshot
On Derivation Trees of Indexed Grammars – An Extension of the uvwxy-Theorem
inferredcites →https://doi.org/10.4230/lipics.csl.2011.322openalex-snapshot
A Pumping Lemma for Collapsible Pushdown Graphs of Level 2
inferredcites →https://doi.org/10.4230/lipics.stacs.2010.2480openalex-snapshot
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
inferredcites →https://doi.org/10.4230/lipics.stacs.2011.603openalex-snapshot
Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.54openalex-snapshot
A Pumping Lemma for Pushdown Graphs of Any Level
inferredcites →https://doi.org/10.48550/arxiv.0912.4110openalex-snapshot
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic

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-030-13435-8_27openalex-snapshot
Extensions of the Caucal Hierarchy?
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_23openalex-snapshot
First-Order Logic on CPDA Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_19openalex-snapshot
How Many Numbers Can a Lambda-Term Contain?
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_50openalex-snapshot
Strictness of the Collapsible Pushdown Hierarchy
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.1007/978-3-642-39212-2_31openalex-snapshot
The IO and OI Hierarchies Revisited
inferred← citeshttps://doi.org/10.1007/s00224-014-9533-0openalex-snapshot
On First-Order Logic and CPDA Graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.015openalex-snapshot
The IO and OI hierarchies revisited
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104782openalex-snapshot
The Caucal hierarchy: Interpretations in the (W)MSO+U logic
inferred← citeshttps://doi.org/10.1017/s0956796816000113openalex-snapshot
A characterization of lambda-terms transforming numerals
inferred← citeshttps://doi.org/10.1017/s0960129514000590openalex-snapshot
Simply typed fixpoint calculus and collapsible pushdown automata
inferred← citeshttps://doi.org/10.1109/lics.2008.34openalex-snapshot
Collapsible Pushdown Automata and Recursion Schemes
inferred← citeshttps://doi.org/10.1109/lics.2012.73openalex-snapshot
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection
inferred← citeshttps://doi.org/10.1109/lics.2013.46openalex-snapshot
Pumping by Typing
inferred← citeshttps://doi.org/10.1109/lics.2015.9openalex-snapshot
Higher-Order Model Checking: An Overview
inferred← citeshttps://doi.org/10.1145/2837614.2837627openalex-snapshot
Unboundedness and downward closures of higher-order pushdown automata
inferred← citeshttps://doi.org/10.1145/2914770.2837627openalex-snapshot
Unboundedness and downward closures of higher-order pushdown automata
inferred← citeshttps://doi.org/10.1145/3091122openalex-snapshot
Collapsible Pushdown Automata and Recursion Schemes
inferred← citeshttps://doi.org/10.1145/3452917openalex-snapshot
Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:11)2020openalex-snapshot
On the Expressive Power of Higher-Order Pushdown Systems
inferred← citeshttps://doi.org/10.4204/eptcs.242.6openalex-snapshot
Intersection Types and Counting
inferred← citeshttps://doi.org/10.4204/eptcs.293.2openalex-snapshot
Intersection Types for Unboundedness Problems
inferred← citeshttps://doi.org/10.4204/eptcs.96.16openalex-snapshot
Higher-Order Pushdown Systems with Data
inferred← citeshttps://doi.org/10.4230/lipics.csl.2012.500openalex-snapshot
Variants of Collapsible Pushdown Systems
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.160openalex-snapshot
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.103openalex-snapshot
Evaluation is MSOL-compatible
inferred← citeshttps://doi.org/10.5287/ora-o8oygp8pnopenalex-snapshot
Intersection types and higer-order model checking
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.