Pages that link to "Item:Q3470112"

The following pages link to The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112):

Displaying 39 items.

• Fly-automata for checking monadic second-order properties of graphs of bounded tree-width (Q324700) (← links)
• Automorphism groups of context-free graphs (Q671518) (← links)
• The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
• On the regular structure of prefix rewriting (Q685354) (← links)
• Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
• The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
• The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
• Linearly bounded infinite graphs (Q852011) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
• Distributive lattices with a decidable monadic second order theory. (Q1771945) (← links)
• The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
• On infinite transition graphs having a decidable monadic theory (Q1853615) (← links)
• The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
• Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
• Regular sets of infinite message sequence charts (Q1887140) (← links)
• Shelah-Stupp's and Muchnik's iterations revisited (Q2117107) (← links)
• Graphs and models with finite chains (Q2481180) (← links)
• Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
• The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
• A logic of reachable patterns in linked data-structures (Q2643337) (← links)
• Rewriting in the partial algebra of typed terms modulo AC (Q2842873) (← links)
• Regularity Equals Monadic Second-Order Definability for Quasi-trees (Q2947169) (← links)
• Monadic structures over an ordered universal random graph and finite automata (Q3104500) (← links)
• Simple monadic theories and partition width (Q3170562) (← links)
• Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (Q3521904) (← links)
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
• Automata-based Representations for Infinite Graphs (Q4331049) (← links)
• Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic (Q4333462) (← links)
• An effective version of Stallings' theorem in the case of context-free groups (Q4630285) (← links)
• Where First-Order and Monadic Second-Order Logic Coincide (Q5278195) (← links)
• On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
• Algebraic and logical descriptions of generalized trees (Q5367045) (← links)
• Computer Science Logic (Q5394586) (← links)
• Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs (Q5418961) (← links)
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
• Succinct data structures for bounded clique-width graphs (Q6497944) (← links)