Pages that link to "Item:Q1891154"

The following pages link to Structural properties of context-free sets of graphs generated by vertex replacement (Q1891154):

Displaying 19 items.

• Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
• Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
• Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
• Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
• Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
• The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
• The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
• Logical description of context-free graph languages (Q1384534) (← links)
• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
• Upper bounds to the clique width of graphs (Q1975365) (← links)
• The recognizability of sets of graphs is a robust property (Q2566292) (← links)
• Simple monadic theories and partition width (Q3170562) (← links)
• Context-free graph grammars: Separating vertex replacement from hyperedge repelacement (Q4284239) (← links)
• The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed (Q4645287) (← links)
• The definition in monadic second-order logic of modular decompositions of ordered graphs (Q4645296) (← links)
• (Q4852905) (← links)
• Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
• On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
• Relational structures constructible by quantifier free definable operations (Q5444700) (← links)