Pages that link to "Item:Q1384534"

The following pages link to Logical description of context-free graph languages (Q1384534):

Displaying 13 items.

• On the structure of linear apex NLC graph grammars (Q441855) (← links)
• Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• Weighted tree automata and weighted logics (Q860890) (← links)
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← 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)
• 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)
• Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
• The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
• (Q5089253) (← links)
• On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)