On the public citation graph
The monadic second-order logic of graphs, II: Infinite graphs of bounded width
0 signed · 101 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-18771-5_49openalex-snapshot
A representation of graphs by algebraic expressions and its use for graph rewriting systems
inferredcites →https://doi.org/10.1007/3-540-50728-0_35openalex-snapshot
On systems of equations defining infinite graphs
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bfb0099486openalex-snapshot
Toward logic tailored for computational complexity
inferredcites →https://doi.org/10.1016/0168-0072(91)90054-popenalex-snapshot
The structure of the models of decidable monadic theories of graphs
inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1016/0304-3975(85)90087-8openalex-snapshot
The theory of ends, pushdown automata, and second-order logic
inferredcites →https://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferredcites →https://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
inferredcites →https://doi.org/10.1016/s0022-0000(70)80041-1openalex-snapshot
Tree acceptors and some of their applications
inferredcites →https://doi.org/10.1090/cbms/013openalex-snapshot
Automata on Infinite Objects and Church’s Problem
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.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.201010019openalex-snapshot
Simple monadic theories and partition width
inferred← citeshttps://doi.org/10.1006/jagm.1993.1001openalex-snapshot
On Linear Time Minor Tests with Depth-First Search
inferred← citeshttps://doi.org/10.1006/jcss.1996.0013openalex-snapshot
Finite Languages for the Representation of Finite Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_41openalex-snapshot
Decidable Theories of Cayley-Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_15openalex-snapshot
The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_48openalex-snapshot
On Equivalent Representations of Infinite Structures
inferred← citeshttps://doi.org/10.1007/3-540-45132-3_7openalex-snapshot
Some Applications of the Decidability of DPDA’s Equivalence
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_64openalex-snapshot
On the Theory of One-Step Rewriting in Trace Monoids
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_49openalex-snapshot
Axiomatising Tree-Interpretable Structures
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_10openalex-snapshot
A Short Introduction to Infinite Automata
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_30openalex-snapshot
Synchronized product of linear bounded machines
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_54openalex-snapshot
Monadic second-order logic and context-free graph-grammars
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_48openalex-snapshot
On linear time minor tests and depth first search
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_17openalex-snapshot
Improved self-reduction algorithms for graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_42openalex-snapshot
On the regular structure of prefix rewriting
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_51openalex-snapshot
On the transition graphs of automata and grammars
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_7openalex-snapshot
Monadic second-order definable graph transductions
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_64openalex-snapshot
Approximating treewidth and pathwidth of some classes of perfect graphs
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_96openalex-snapshot
An effective version of Stallings' theorem in the case of context-free groups
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_5openalex-snapshot
Five facets of hyperedge replacement beyond context-freeness
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_129openalex-snapshot
Semi-groups acting on context-free graphs
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_3openalex-snapshot
Finite Model Theory and Descriptive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_24openalex-snapshot
Shelah-Stupp’s and Muchnik’s Iterations Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-06880-0_8openalex-snapshot
Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_38openalex-snapshot
On the Expressiveness of Deterministic Transducers over Infinite Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_41openalex-snapshot
Compositional Verification: Decidability Issues Using Graph Substitutions
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_36openalex-snapshot
Decidability of MSO Theories of Tree Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_31openalex-snapshot
A String-Rewriting Characterization of Muller and Schupp’s Context-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_18openalex-snapshot
Path Algorithms on Regular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_2openalex-snapshot
Finite Model Theory on Tame Classes of Structures
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-15205-4_29openalex-snapshot
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_19openalex-snapshot
Counterpart Semantics for a Second-Order μ-Calculus
inferred← citeshttps://doi.org/10.1007/bfb0017376openalex-snapshot
The logical expression of graph properties
inferred← citeshttps://doi.org/10.1007/bfb0017390openalex-snapshot
An application of graph grammars to the elimination of redundancy from functions defined by schemes
inferred← citeshttps://doi.org/10.1007/bfb0017410openalex-snapshot
Tree automata, tree decomposition and hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0028029openalex-snapshot
A hierarchical approach to monadic second-order logic over graphs
inferred← citeshttps://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferred← citeshttps://doi.org/10.1007/bfb0030586openalex-snapshot
Automata theory on trees and partial orders
inferred← citeshttps://doi.org/10.1007/bfb0035762openalex-snapshot
The definability of equational graphs in monadic second-order logic
inferred← citeshttps://doi.org/10.1007/bfb0055804openalex-snapshot
When can an equational simple graph be generated by hyperedge replacement?
inferred← citeshttps://doi.org/10.1007/bfb0055807openalex-snapshot
Representing hyper-graphs by regular languages
inferred← citeshttps://doi.org/10.1007/s00224-001-1015-5openalex-snapshot
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs
inferred← citeshttps://doi.org/10.1007/s00224-003-1104-8openalex-snapshot
Axiomatising Tree-Interpretable Structures
inferred← citeshttps://doi.org/10.1007/s00224-004-1133-yopenalex-snapshot
Finite Presentations of Infinite Structures: Automata and Interpretations
inferred← citeshttps://doi.org/10.1007/s00236-006-0022-zopenalex-snapshot
Linearly bounded infinite graphs
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90027-yopenalex-snapshot
The monadic second-order logic of graphs IV: definability properties of equational graphs11This work has been supported by the “Programme de Recherches Coordonnées: Mathématiques et Informatique”, and by the ESPRIT-Basic Research Action contract No. 3299, “Computing by graph transformations”.
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90278-nopenalex-snapshot
On the regular structure of prefix rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00049-3openalex-snapshot
The monadic second-order logic of graphs IX: Machines and their behaviours
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00222-8openalex-snapshot
Automorphism groups of context-free graphs
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50010-xopenalex-snapshot
Graph Rewriting: An Algebraic and Logic Approach
inferred← citeshttps://doi.org/10.1016/j.apal.2004.06.002openalex-snapshot
Logical aspects of Cayley-graphs: the group case
inferred← citeshttps://doi.org/10.1016/j.artint.2013.05.002openalex-snapshot
Automata for infinite argumentation structures
inferred← citeshttps://doi.org/10.1016/j.dam.2024.03.016openalex-snapshot
Succinct data structures for bounded clique-width graphs
inferred← citeshttps://doi.org/10.1016/j.jal.2005.08.004openalex-snapshot
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
inferred← citeshttps://doi.org/10.1016/j.jlap.2006.12.001openalex-snapshot
A logic of reachable patterns in linked data-structures
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00281-3openalex-snapshot
Deterministic finite automata with recursive calls and DPDAs
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00065-5openalex-snapshot
Automatic graphs and D0L-sequences of finite graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00285-1openalex-snapshot
L(A)=L(B)? decidability results from complete formal systems
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00123-8openalex-snapshot
Regular sets of infinite message sequence charts
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80532-2openalex-snapshot
Rewriting in the partial algebra of typed terms modulo AC
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80200-2openalex-snapshot
Model-Checking of Infinite Kripke Structures Defined by Simple Graph Grammars
inferred← citeshttps://doi.org/10.1051/ita/1992260302571openalex-snapshot
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
inferred← citeshttps://doi.org/10.1051/ita:2001122openalex-snapshot
Automata-based Representations for Infinite Graphs
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175832openalex-snapshot
Quantifying Over Trees in Monadic Second-Order Logic
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743435openalex-snapshot
Decidability of bisimulation equivalence for equational graphs of finite out-degree
inferred← citeshttps://doi.org/10.1137/s0097539700377256openalex-snapshot
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
inferred← citeshttps://doi.org/10.1145/2976736openalex-snapshot
Guarded-Based Disjunctive Tuple-Generating Dependencies
inferred← citeshttps://doi.org/10.1145/3034786.3034794openalex-snapshot
Stable Model Semantics for Tuple-Generating Dependencies Revisited
inferred← citeshttps://doi.org/10.1145/3322095openalex-snapshot
1-Safe Petri Nets and Special Cube Complexes
inferred← citeshttps://doi.org/10.1145/3424908openalex-snapshot
Semantic Optimization of Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3776716openalex-snapshot
Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures
inferred← citeshttps://doi.org/10.14778/1687627.1687737openalex-snapshot
On chase termination beyond stratification
inferred← citeshttps://doi.org/10.18419/opus-2455openalex-snapshot
Hierarchische Graphen zur Wegesuche
inferred← citeshttps://doi.org/10.2168/lmcs-3(2:4)2007openalex-snapshot
Transforming structures by set interpretations
inferred← citeshttps://doi.org/10.3233/fi-1999-39305openalex-snapshot
Thue Specifications and Their Monadic Second-order Properties
inferred← citeshttps://doi.org/10.3233/fi-2012-709openalex-snapshot
Counterpart Semantics for a Second-Order μ-Calculus
inferred← citeshttps://doi.org/10.3233/fi-2018-1667openalex-snapshot
Shelah-Stupp’s Iteration and Muchnik’s Iteration
inferred← citeshttps://doi.org/10.3233/fun-2000-44303openalex-snapshot
Thue Specifications, Infinite Graphs and Synchronized Product
inferred← citeshttps://doi.org/10.5109/13421openalex-snapshot
A GRAPH REDUCTION SYSTEM USING GRAPH TERMS
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.