The following pages link to (Q4852905):
Displaying 27 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
- Nondeterministic operations on finite relational structures (Q1276248) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Tree-based picture generation (Q1583092) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
- Generalized rational relations and their logical definability (Q5055929) (← links)
- (Q5089253) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
