Pages that link to "Item:Q1193407"

The following pages link to The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407):

Displaying 37 items.

• Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
• The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
• Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
• Graph operations characterizing rank-width (Q1028455) (← links)
• Nondeterministic operations on finite relational structures (Q1276248) (← 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)
• The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
• Logical description of context-free graph languages (Q1384534) (← links)
• Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
• The evaluation of first-order substitution is monadic second-order compatible (Q1603690) (← links)
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
• The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
• An operational and denotational approach to non-context-freeness (Q1870568) (← links)
• Upper bounds to the clique width of graphs (Q1975365) (← links)
• Shelah-Stupp's and Muchnik's iterations revisited (Q2117107) (← links)
• Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
• Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
• Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
• A model-theoretic characterisation of clique width (Q2503407) (← links)
• The recognizability of sets of graphs is a robust property (Q2566292) (← links)
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
• Graph operations and monadic second-order logic: A survey (Q2767003) (← links)
• Simple monadic theories and partition width (Q3170562) (← links)
• Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (Q3521904) (← links)
• Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (Q3618564) (← links)
• On context-free sets of graphs and their monadic second-order theory (Q3785987) (← links)
• Monadic second-order logic and context-free graph-grammars (Q3975133) (← links)
• Graphs as relational structures: An algebraic and logical approach (Q4037312) (← links)
• Logic and graphs (Q4222789) (← links)
• (Q4273871) (← links)
• Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
• (Q4852905) (← links)
• Graph Operations, Graph Transformations and Monadic Second-Order Logic: (Q4923534) (← links)
• The monadic second-order logic of graphs XVI : Canonical graph decompositions (Q5310655) (← links)
• On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
• Relational structures constructible by quantifier free definable operations (Q5444700) (← links)