On the public citation graph

Unsafe Grammars and Panic Automata

0 signed · 71 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/11417170_5openalex-snapshot
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable
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-36387-4openalex-snapshot
Automata logics, and infinite games: a guide to current research
inferredcites →https://doi.org/10.1007/3-540-45061-0_45openalex-snapshot
Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games
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-45687-2_13openalex-snapshot
On Infinite Terms Having a Decidable Monadic Theory
inferredcites →https://doi.org/10.1007/3-540-45687-2_42openalex-snapshot
Unit Testing for Casl Architectural Specifications
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-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/978-3-642-59126-6openalex-snapshot
Handbook of Formal Languages
inferredcites →https://doi.org/10.1007/978-3-642-59126-6_7openalex-snapshot
Languages, Automata, and Logic
inferredcites →https://doi.org/10.1016/0304-3975(82)90009-3openalex-snapshot
The IO- and OI-hierarchies
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/s0022-0000(77)80034-2openalex-snapshot
IO and OI. I
inferredcites →https://doi.org/10.1016/s0304-3975(02)00012-9openalex-snapshot
The evaluation of first-order substitution is monadic second-order compatible
inferredcites →https://doi.org/10.1016/s0304-3975(97)00039-xopenalex-snapshot
Fixed point characterization of infinite behavior of finite-state systems
inferredcites →https://doi.org/10.1109/sfcs.1991.185392openalex-snapshot
Tree automata, mu-calculus and determinacy
inferredcites →https://doi.org/10.1145/800061.808767openalex-snapshot
Iterated pushdown automata and complexity classes
inferredcites →https://doi.org/10.7146/dpb.v4i47.6466openalex-snapshot
IO and OI

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11417170_5openalex-snapshot
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable
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-06686-8_23openalex-snapshot
First-Order Logic on CPDA Graphs
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-71389-0_16openalex-snapshot
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
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-04420-5_19openalex-snapshot
Games on Higher Order Multi-stack Pushdown Systems
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-13754-9_11openalex-snapshot
An Automata-Theoretic Approach to Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_12openalex-snapshot
Krivine Machines and Higher-Order Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_17openalex-snapshot
Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_18openalex-snapshot
A Saturation Method for Collapsible Pushdown Systems
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/s00224-014-9533-0openalex-snapshot
On First-Order Logic and CPDA Graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2014.07.012openalex-snapshot
Krivine machines and higher-order schemes
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.2008.34openalex-snapshot
Collapsible Pushdown Automata and Recursion Schemes
inferred← citeshttps://doi.org/10.1109/lics.2010.40openalex-snapshot
Recursion Schemes and Logical Reflection
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.2012.62openalex-snapshot
On the Significance of the Collapse Operation
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.1145/1480881.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/2487241.2487246openalex-snapshot
Model Checking Higher-Order Programs
inferred← citeshttps://doi.org/10.1145/2500365.2500589openalex-snapshot
C-SHORe
inferred← citeshttps://doi.org/10.1145/2544174.2500589openalex-snapshot
C-SHORe
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.1145/3457214openalex-snapshot
Collapsible Pushdown Parity Games
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.3233/fi-2018-1667openalex-snapshot
Shelah-Stupp’s Iteration and Muchnik’s Iteration
inferred← citeshttps://doi.org/10.4204/eptcs.151.1openalex-snapshot
Saturation algorithms for model-checking pushdown systems
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.228openalex-snapshot
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.103openalex-snapshot
Evaluation is MSOL-compatible
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.313openalex-snapshot
Saturation of Concurrent Collapsible Pushdown Systems
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2015.163openalex-snapshot
Ordered Tree-Pushdown Systems
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.603openalex-snapshot
Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.589openalex-snapshot
The Limits of Decidability for First Order Logic on CPDA Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2010.06361openalex-snapshot
Collapsible Pushdown Parity Games
inferred← citeshttps://doi.org/10.5287/ora-7rg81n5vyopenalex-snapshot
Saturation methods for global model-checking pushdown systems
inferred← citeshttps://doi.org/10.70675/0df3c23cz2df4z413az9933z0a3bb0ebda9aopenalex-snapshot
The structure of orders in the pushdown hierarchy
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.