Pages that link to "Item:Q1176232"

The following pages link to The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232):

Displaying 47 items.

• Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
• 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)
• Weighted parsing for grammar-based language models over multioperator monoids (Q2051800) (← links)
• Shelah-Stupp's and Muchnik's iterations revisited (Q2117107) (← links)
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars (Q2117263) (← links)
• Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← 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)
• Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Towards a characterization of order-invariant queries over tame graphs (Q3616348) (← links)
• Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
• Recognizability equals definability for partial k-paths (Q4572008) (← links)
• The use of tree transducers to compute translations between graph algebras (Q4645277) (← 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)
• A Retrospective on (Meta) Kernelization (Q5042460) (← links)
• Regular-factors in the complements of partial k-trees (Q5057452) (← links)
• (Q5089180) (← links)
• Recognizable sets of graphs of bounded tree-width (Q5096279) (← links)
• MSO definable text languages (Q5096900) (← links)
• (Q5111293) (← links)
• (Q5207048) (← links)
• Definability equals recognizability of partial 3-trees (Q6550548) (← links)