Pages that link to "Item:Q3975133"

The following pages link to Monadic second-order logic and context-free graph-grammars (Q3975133):

Displaying 15 items.

• Polymorphic syntax definition (Q1129122) (← links)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
• A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
• Monadic second-order logic, graph coverings and unfoldings of transition systems (Q1295371) (← links)
• Monadic second-order definable text languages (Q1361884) (← links)
• wMSO theories as grammar formalisms (Q1870569) (← links)
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
• On context-free sets of graphs and their monadic second-order theory (Q3785987) (← links)
• On using context-free graph grammars for analyzing recursive definitions (Q3830540) (← links)
• Logic and graphs (Q4222789) (← links)
• (Q4241260) (← links)
• (Q4273871) (← links)
• Prefix-Recognizable Graphs and Monadic Logic (Q4412838) (← links)
• Graph Operations, Graph Transformations and Monadic Second-Order Logic: (Q4923534) (← links)