Pages that link to "Item:Q3785987"
From MaRDI portal
The following pages link to On context-free sets of graphs and their monadic second-order theory (Q3785987):
Displaying 25 items.
- Courcelle's theorem for triangulations (Q346450) (← links)
- Recursive queries and context-free graph grammars (Q753477) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- Undecidability of the bandwidth problem on linear graph languages (Q908714) (← links)
- The theory of ends, pushdown automata, and second-order logic (Q1084096) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← links)
- Algorithms for graph problems on BNLC structured garphs (Q1175948) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- Infinite hypergraphs. II: Systems of recursive equations (Q1199532) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- Correctness of fixpoint transformations (Q1329743) (← links)
- On the decidability of certain integer subgraph problems on context-free graph languages (Q1333275) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- A comparison of compatible, finite, and inductive graph properties (Q1812942) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
- Graphes canoniques de graphes algébriques (Q3479542) (← links)
- Graph expressions and graph rewritings (Q3782818) (← links)
- On using context-free graph grammars for analyzing recursive definitions (Q3830540) (← links)
- Monadic second-order logic and context-free graph-grammars (Q3975133) (← links)
- The HOMFLY-PT polynomial is fixed-parameter tractable (Q5115785) (← links)
- Context-Free Graph Properties via Definable Decompositions (Q5278403) (← links)