Pages that link to "Item:Q3521904"

The following pages link to Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (Q3521904):

Displaying 21 items.

• Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
• The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
• T-structures, T-functions, and texts (Q685376) (← links)
• Treewidth and logical definability of graph products (Q1006041) (← links)
• A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
• The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
• Monadic second-order logic, graph coverings and unfoldings of transition systems (Q1295371) (← links)
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
• Graph operations and monadic second-order logic: A survey (Q2767003) (← links)
• $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
• Graph structure and monadic second-order logic. A language-theoretic approach (Q3077955) (← links)
• Logics and Automata for Totally Ordered Trees (Q3522020) (← links)
• Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (Q3618564) (← links)
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
• (Q4241260) (← links)
• (Q4273871) (← links)
• On the expression of graph properties in some fragments of monadic second-order logic (Q4353558) (← links)
• Prefix-Recognizable Graphs and Monadic Logic (Q4412838) (← links)
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5918962) (← links)
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5925549) (← links)
• Counting on rainbow \(k\)-connections (Q6636091) (← links)