The following pages link to Bruno Courcelle (Q6482121):
Displaying 1 item.
- (Q248922) (redirect page) (← links)
- (Q169279) (redirect page) (← links)
- Fly-automata for checking monadic second-order properties of graphs of bounded tree-width (Q324700) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Several notions of rank-width for countable graphs (Q505916) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
- Recursive queries and context-free graph grammars (Q753477) (← links)
- The solutions of two star-height problems for regular trees (Q760212) (← links)
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Linear delay enumeration and monadic second-order logic (Q967312) (← links)
- A multivariate interlace polynomial and its computation for graphs of bounded clique-width (Q1010789) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Some negative results concerning DPDA's (Q1058306) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- The simultaneous accessibility of two configurations of two equivalent DPDA's (Q1152220) (← links)
- Attribute grammars and recursive program schemes. I. II (Q1162363) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- On some classes of interpretations (Q1251892) (← links)
- Monadic second-order logic, graph coverings and unfoldings of transition systems (Q1295371) (← links)
- Une axiomatisation au premier ordre des arrangements de pseudodroites euclidiennes. (A first-order axiomatisation of arrangements of Euclidean pseudolines.) (Q1296148) (← links)
- Coverings and minors: Application to local computations in graphs (Q1317492) (← 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)
- 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)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
- Clique-width of countable graphs: A compactness property. (Q1422417) (← links)
- The monadic second-order logic of graphs. XII: Planar graphs and planar maps (Q1566702) (← links)
- The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings (Q1575704) (← links)
- The evaluation of first-order substitution is monadic second-order compatible (Q1603690) (← links)
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- Map genus, forbidden maps, and monadic second-order logic (Q1856334) (← links)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
- Structural properties of context-free sets of graphs generated by vertex replacement (Q1891154) (← links)
- Erratum to ``The monadic second-order logic of graphs. VI: On several representations of graphs by relational structures'' (Q1902907) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← links)
- Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- On defining linear orders by automata (Q2211260) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- Clique-width and edge contraction (Q2350597) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← 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 recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming (Q2640347) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- (Q2767003) (← links)
- (Q2816072) (← links)
- Model-Checking by Infinite Fly-Automata (Q2850017) (← links)
- Monadic second-order definable graph orderings (Q2871227) (← links)
- (Q2908834) (← links)
- Regularity Equals Monadic Second-Order Definability for Quasi-trees (Q2947169) (← links)
- (Q3077955) (← links)
- (Q3086924) (← links)
- Fusion in relational structures and the verification of monadic second-order properties (Q3146251) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- On the equivalence problem for attribute systems (Q3311643) (← links)
- (Q3400628) (← links)
- (Q3400629) (← links)
- Graph decompositions definable in monadic second-order logic (Q3439302) (← links)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (Q3521904) (← links)
- On the Monadic Second-Order Transduction Hierarchy (Q3575301) (← links)
- Compact Forbidden-Set Routing (Q3590921) (← links)
- (Q3615812) (← links)
- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (Q3618564) (← links)
- On Several Proofs of the Recognizability Theorem (Q3642524) (← links)
- (Q3659160) (← links)
- (Q3667929) (← links)
- (Q3675498) (← links)
- (Q3692880) (← links)
- An axiomatic approach to the Korenjak-Hopcroft algorithms (Q3703289) (← links)
- (Q3742748) (← links)
- (Q3756502) (← links)
- Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)
- (Q3776662) (← links)
- Graph expressions and graph rewritings (Q3782818) (← links)
- (Q3785986) (← links)
- (Q3785987) (← links)
- (Q3787506) (← links)
- (Q3830540) (← links)
- Infinite trees in normal form and recursive equations having a unique solution (Q3851585) (← links)
- (Q3868789) (← links)
- (Q3907115) (← links)
- (Q3912007) (← links)
- (Q3912630) (← links)
- The Rational Index: A Complexity Measure for Languages (Q3923626) (← links)
- (Q3959406) (← links)
- (Q3975133) (← links)
- (Q4005197) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- (Q4029594) (← links)
- (Q4037294) (← links)
- (Q4037299) (← links)
- (Q4037312) (← links)
- (Q4037313) (← links)
- (Q4057634) (← links)
- (Q4127365) (← links)
- (Q4130957) (← links)
- (Q4140410) (← links)
- On jump-deterministic pushdown automata (Q4141220) (← links)
- (Q4164787) (← links)
- (Q4192947) (← links)
- (Q4192990) (← links)
- (Q4198080) (← links)
- (Q4205068) (← links)
- (Q4218137) (← links)
- (Q4222789) (← links)
- (Q4232773) (← links)
- (Q4273663) (← links)
- (Q4273871) (← links)
- (Q4284239) (← links)
- An algebraic theory of graph reduction (Q4285634) (← links)
- Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
- (Q4347951) (← links)
- (Q4353558) (← links)
- (Q4385531) (← links)
- (Q4385535) (← links)
- (Q4431332) (← links)
- (Q4431361) (← links)
- (Q4438805) (← links)
- (Q4474837) (← links)
- (Q4520519) (← 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)
- (Q4713368) (← links)
- (Q4729378) (← links)
- (Q4738213) (← links)
- (Q4772711) (← links)
- (Q4772720) (← links)
- (Q4852905) (← links)
- Mineurs d'arbres avec racines (Q4858839) (← links)
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width (Q4882496) (← links)
- Graph Operations, Graph Transformations and Monadic Second-Order Logic: (Q4923534) (← links)
- The Common Structure of the Curves Having a Same Gauss Word (Q4982988) (← links)
- Betweenness of partial orders (Q5021103) (← links)
- Induced betweenness in order-theoretic trees (Q5038203) (← links)
- Order-theoretic Trees: Monadic Second-order Descriptions and Regularity (Q5038567) (← links)
- Betweenness in Order-Theoretic Trees (Q5049040) (← links)
- Recognizable sets of graphs of bounded tree-width (Q5096279) (← links)
- Fly-Automata, Their Properties and Applications (Q5200070) (← links)
- Connectivity check in 3-connected planar graphs with obstacles (Q5300999) (← links)
- The monadic second-order logic of graphs XVI : Canonical graph decompositions (Q5310655) (← links)
- (Q5367045) (← links)
- Computer Science Logic (Q5394586) (← links)
- Developments in Language Theory (Q5711946) (← links)
- (Q5856415) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- Unfoldings and Coverings of Weighted Graphs (Q6094515) (← links)
