Pages that link to "Item:Q1176232"
From MaRDI portal
The following pages link to The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232):
Displayed 27 items.
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
- Weighted tree automata and weighted logics (Q860890) (← links)
- The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) (Q1209328) (← links)
- Computing with graph rewriting systems with priorities (Q1261464) (← 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)
- Monadic second-order definable text languages (Q1361884) (← links)
- The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
- The obstructions of a minor-closed set of graphs defined by a context-free grammar (Q1379821) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- Rationality in algebras with a series operation (Q1854484) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← 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)
- Towards a characterization of order-invariant queries over tame graphs (Q3616348) (← links)
- Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
- (Q4852905) (← links)