Bruno Courcelle

196 papers A* 12A 2B 14C 3Misc 2Journal 121Unranked 35
YearRankTypeTitle / Venue / Authors
2026 J jnl
On describing trees and quasi-trees from their leaves.
RAIRO Theor. Informatics Appl.
Bruno Courcelle
2026 J jnl
On using SAT solvers for graph computations.
Discret. Appl. Math.
Bruno Courcelle, Irène Durand
2025 J jnl
On describing trees and quasi-trees from their leaves.
CoRR
Bruno Courcelle
2025 J jnl
On regular trees defined from unfoldings and coverings.
Inf. Comput.
Bruno Courcelle
2022 J jnl
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity.
Fundam. Informaticae
Bruno Courcelle
2022 J jnl
Unfoldings and Coverings of Weighted Graphs.
Fundam. Informaticae
Bruno Courcelle
2022 J jnl
Unfoldings and coverings of weighted graphs.
CoRR
Bruno Courcelle, Yves Métivier
2021 J jnl
Axiomatization of betweenness in order-theoretic trees.
Log. Methods Comput. Sci.
Bruno Courcelle
2021 J jnl
Induced betweenness in order-theoretic trees.
CoRR
Bruno Courcelle
2021 J jnl
Induced betweenness in order-theoretic trees.
Discret. Math. Theor. Comput. Sci.
Bruno Courcelle
2021 J jnl
Order-theoretic trees: monadic second-order descriptions and regularity.
CoRR
Bruno Courcelle
2020 J jnl
A unified algorithm for colouring graphs of bounded clique-width.
CoRR
Bruno Courcelle, Irène Durand, Michael Raskin
2020 J jnl
Axiomatization of betweenness in order-theoretic trees.
CoRR
Bruno Courcelle
2020 — conf
Betweenness in Order-Theoretic Trees.
Fields of Logic and Computation III
Bruno Courcelle
2020 J jnl
Betweenness of partial orders.
CoRR
Bruno Courcelle
2020 J jnl
Betweenness of partial orders.
RAIRO Theor. Informatics Appl.
Bruno Courcelle
2020 J jnl
Grammars and clique-width bounds from split decompositions.
Discret. Appl. Math.
Bruno Courcelle
2020 J jnl
On quasi-planar graphs: Clique-width and logical description.
Discret. Appl. Math.
Bruno Courcelle
2018 J jnl
Fly-automata for checking MSO2 graph properties.
Discret. Appl. Math.
Bruno Courcelle
2018 J jnl
From tree-decompositions to clique-width terms.
Discret. Appl. Math.
Bruno Courcelle
2017 J jnl
Algebraic and logical descriptions of generalized trees.
Log. Methods Comput. Sci.
Bruno Courcelle
2017 J jnl
Several notions of rank-width for countable graphs.
J. Comb. Theory B
Bruno Courcelle
2016 J jnl
Algebraic and logical descriptions of generalized trees.
CoRR
Bruno Courcelle
2016 J jnl
Computations by fly-automata beyond monadic second-order logic.
Theor. Comput. Sci.
Bruno Courcelle, Irène Durand
2016 — ch.
Model Checking with Fly-Automata.
Encyclopedia of Algorithms
Bruno Courcelle, Irène Durand
2015 J jnl
A characterisation of clique-width through nested partitions.
Discret. Appl. Math.
Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
2015 J jnl
Fly-automata for checking MSO 2 graph properties.
CoRR
Bruno Courcelle
2015 J jnl
Fly-automata for checking monadic second-order properties of graphs of bounded tree-width.
Electron. Notes Discret. Math.
Bruno Courcelle
2015 — conf
Regularity Equals Monadic Second-Order Definability for Quasi-trees.
Fields of Logic and Computation II
Bruno Courcelle
2014 J jnl
Clique-width and edge contraction.
Inf. Process. Lett.
Bruno Courcelle
2014 J jnl
Fly-automata, model-checking and recognizability.
CoRR
Bruno Courcelle, Irène Durand
2014 J jnl
Monadic second-order definable graph orderings.
Log. Methods Comput. Sci.
Achim Blumensath, Bruno Courcelle
2013 J jnl
Clique-width and edge contraction.
CoRR
Bruno Courcelle
2013 J jnl
Computations by fly-automata beyond monadic second-order logic
CoRR
Bruno Courcelle, Irène Durand
2013 — conf
Infinite Transducers on Terms Denoting Graphs.
ELS
Irène Durand, Bruno Courcelle
2013 — conf
Model-Checking by Infinite Fly-Automata.
CAI
Bruno Courcelle, Irène Durand
2012 J jnl
Automata for the verification of monadic second-order graph properties.
J. Appl. Log.
Bruno Courcelle, Irène Durand
2012 J jnl
Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach.
Bull. EATCS
Bruno Courcelle, Joost Engelfriet
2012 — book
Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach.
Bruno Courcelle, Joost Engelfriet
2012 J jnl
On the model-checking of monadic second-order formulas with edge set quantifications.
Discret. Appl. Math.
Bruno Courcelle
2011 — conf
Automata for Monadic Second-Order Model-Checking.
RP
Bruno Courcelle
2011 J jnl
Compact labelings for efficient first-order model-checking.
J. Comb. Optim.
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
2011 C conf
Fly-Automata, Their Properties and Applications.
CIAA
Bruno Courcelle, Irène Durand
2010 J jnl
Constrained-Path Labellings on Graphs of Bounded Clique-Width.
Theory Comput. Syst.
Bruno Courcelle, Andrew Twigg
2010 J jnl
On the Monadic Second-Order Transduction Hierarchy
Log. Methods Comput. Sci.
Achim Blumensath, Bruno Courcelle
2010 — conf
Special tree-width and the verification of monadic second-order graph pr operties.
FSTTCS
Bruno Courcelle
2010 — conf
Verifying Monadic Second Order Graph Properties with Tree Automata.
ELS
Bruno Courcelle, Irène Durand
2009 J jnl
Graph operations characterizing rank-width.
Discret. Appl. Math.
Bruno Courcelle, Mamadou Moustapha Kanté
2009 J jnl
Linear delay enumeration and monadic second-order logic.
Discret. Appl. Math.
Bruno Courcelle
2009 C conf
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications.
LATA
Bruno Courcelle
2009 — conf
On Several Proofs of the Recognizability Theorem.
CAI
Bruno Courcelle
2008 J jnl
A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width.
Electron. J. Comb.
Bruno Courcelle
2008 J jnl
Circle graphs and monadic second-order logic.
J. Appl. Log.
Bruno Courcelle
2008 J jnl
Compact Labelings For Efficient First-Order Model-Checking
CoRR
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
2008 J jnl
Connectivity check in 3-connected planar graphs with obstacles.
Electron. Notes Discret. Math.
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg
2008 Misc conf
Efficient First-Order Model-Checking Using Short Labels.
FAW
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
2008 — conf
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects.
ICALP (1)
Bruno Courcelle
2008 — conf
Quantifier-free definable graph operations preserving recognizability.
Logic and Automata
Bruno Courcelle
2008 J jnl
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic.
Theor. Comput. Sci.
Bruno Courcelle, Christian Delhommé
2007 J jnl
A multivariate interlace polynomial
CoRR
Bruno Courcelle
2007 A conf
Compact Forbidden-Set Routing.
STACS
Bruno Courcelle, Andrew Twigg
2007 B conf
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions.
WG
Bruno Courcelle, Mamadou Moustapha Kanté
2007 J jnl
Vertex-minors, monadic second-order logic, and a conjecture by Seese.
J. Comb. Theory B
Bruno Courcelle, Sang-il Oum
2006 J jnl
Recognizability, hypergraph operations, and logical types.
Inf. Comput.
Achim Blumensath, Bruno Courcelle
2006 J jnl
The monadic second-order logic of graphs XV: On a conjecture by D. Seese.
J. Appl. Log.
Bruno Courcelle
2006 J jnl
The monadic second-order logic of graphs XVI : Canonical graph decompositions.
Log. Methods Comput. Sci.
Bruno Courcelle
2006 J jnl
The recognizability of sets of graphs is a robust property
CoRR
Bruno Courcelle, Pascal Weil
2005 J jnl
Graph decompositions definable in monadic second-order logic.
Electron. Notes Discret. Math.
Bruno Courcelle
2005 B conf
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic.
CSL
Bruno Courcelle, Christian Delhommé
2005 J jnl
The monadic second-order logic of graphs XVI : Canonical graph decompositions
CoRR
Bruno Courcelle
2005 J jnl
The recognizability of sets of graphs is a robust property.
Theor. Comput. Sci.
Bruno Courcelle, Pascal Weil
2004 J jnl
Clique-width of countable graphs: a compactness property.
Discret. Math.
Bruno Courcelle
2004 C conf
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey.
Developments in Language Theory
Bruno Courcelle
2004 B conf
Workshop on Logic, Graph Transformations, Finite and Infinite Structures.
ICGT
Bruno Courcelle, David Janin
2003 J jnl
Query efficient implementation of graphs of bounded clique-width.
Discret. Appl. Math.
Bruno Courcelle, R. Vanicat
2003 J jnl
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications.
Theor. Comput. Sci.
Bruno Courcelle
2002 J jnl
A Monadic Second-Order Definition of the Structure of Convex Hypergraphs.
Inf. Comput.
Bruno Courcelle
2002 J jnl
Fusion in Relational Structures and the Verification of Monadic Second-Order Properties.
Math. Struct. Comput. Sci.
Bruno Courcelle, Johann A. Makowsky
2002 J jnl
Map Genus, Forbidden Maps, and Monadic Second-Order Logic.
Electron. J. Comb.
Bruno Courcelle, V. Dussaux
2002 B conf
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations.
FoSSaCS
Bruno Courcelle
2002 J jnl
The evaluation of first-order substitution is monadic second-order compatible.
Theor. Comput. Sci.
Bruno Courcelle, Teodor Knapik
2002 B conf
Workshop on Logic, Graph Transformations and Discrete Structures.
ICGT
Bruno Courcelle, Pascal Weil
2001 — conf
Graph Operations, Graph Transformations and Monadic Second-Order Logic: a survey.
GETGRATS Closing Workshop
Bruno Courcelle
2001 J jnl
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic.
Discret. Appl. Math.
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
2000 J jnl
Clique-width of countable graphs: a compactness property.
Electron. Notes Discret. Math.
Bruno Courcelle
2000 B conf
Graph Operations and Monadic Second-Order Logic: A Survey.
LPAR
Bruno Courcelle
2000 J jnl
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.
Theory Comput. Syst.
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
2000 J jnl
The monadic second-order logic of graphs XII: planar graphs and planar maps.
Theor. Comput. Sci.
Bruno Courcelle
2000 J jnl
The monadic second-order logic of graphs XIII: Graph drawings with edge crossings.
Theor. Comput. Sci.
Bruno Courcelle
2000 J jnl
Upper bounds to the clique width of graphs.
Discret. Appl. Math.
Bruno Courcelle, Stephan Olariu
1999 — conf
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas.
RTA
Bruno Courcelle
1999 J jnl
The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected Graphs.
Theor. Comput. Sci.
Bruno Courcelle
1998 B conf
Facial Circuits of Planar Graphs and Context-Free Languages.
MFCS
Bruno Courcelle, Denis Lapoire
1998 B conf
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width.
WG
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
1998 J jnl
Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems.
Ann. Pure Appl. Log.
Bruno Courcelle, Igor Walukiewicz
1998 J jnl
The obstructions of a minor-closed set of graphs defined by a context-free grammar.
Discret. Math.
Bruno Courcelle, Géraud Sénizergues
1997 J jnl
A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals.
J. Univers. Comput. Sci.
Bruno Courcelle, Rodney G. Downey, Michael R. Fellows
1997 Misc conf
Finite Model Theory, Universal Algebra and Graph Grammars.
LFCS
Bruno Courcelle
1997 — ch.
The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic.
Handbook of Graph Grammars
Bruno Courcelle
1996 J jnl
Basic Notions of Universal Algebra for Language Theory and Graph Grammars.
Theor. Comput. Sci.
Bruno Courcelle
1996 J jnl
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width.
Math. Struct. Comput. Sci.
Bruno Courcelle, Jens Lagergren
1996 — conf
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic.
Descriptive Complexity and Finite Models
Bruno Courcelle
1996 J jnl
The Monadic Second-Order Logic of Graphs X: Linear Orderings.
Theor. Comput. Sci.
Bruno Courcelle
1995 J jnl
A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars.
Math. Syst. Theory
Bruno Courcelle, Joost Engelfriet
1995 — conf
Logic and graphs.
SEGRAGRA
Bruno Courcelle
1995 J jnl
Mineurs d'arbres avec racines.
RAIRO Theor. Informatics Appl.
Bruno Courcelle, A. Pariès
1995 J jnl
Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement
Inf. Comput.
Bruno Courcelle
1995 J jnl
The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours.
Theor. Comput. Sci.
Bruno Courcelle
1995 J jnl
The Monadic Second-Order Logic of Graphs VIII: Orientations.
Ann. Pure Appl. Log.
Bruno Courcelle
1995 J jnl
The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures.
Discret. Appl. Math.
Bruno Courcelle
1994 J jnl
Coverings and Minors: Application to Local Computations in Graphs.
Eur. J. Comb.
Bruno Courcelle, Yves Métivier
1994 J jnl
Monadic Second-Order Definable Graph Transductions: A Survey.
Theor. Comput. Sci.
Bruno Courcelle
1994 B conf
Monadic Second-Order Logic and Linear Orderings of Finite Structures.
CSL
Bruno Courcelle
1994 J jnl
Recognizable Sets of Graphs: Equivalent Definitions and Closure Properties.
Math. Struct. Comput. Sci.
Bruno Courcelle
1994 — conf
The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs.
TAGT
Bruno Courcelle
1994 J jnl
The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures
Discret. Appl. Math.
Bruno Courcelle
1994 — conf
The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed.
TAGT
Bruno Courcelle, Géraud Sénizergues
1993 J jnl
An Algebraic Theory of Graph Reduction.
J. ACM
Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
1993 B conf
Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement.
FCT
Bruno Courcelle
1993 — conf
Graph Rewriting: A Bibliographical Guide.
Term Rewriting
Bruno Courcelle
1993 J jnl
Graphs and Monadic Second-Order Logic: Some Open Problems.
Bull. EATCS
Bruno Courcelle
1993 J jnl
Handle-Rewriting Hypergraph Grammars.
J. Comput. Syst. Sci.
Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg
1993 J jnl
Monadic Second-Order Evaluations on Tree-Decomposable Graphs.
Theor. Comput. Sci.
Bruno Courcelle, Mohamed Mosbah
1993 A* conf
Monadic Second-Order Logic and Hypergraph Orientation
LICS
Bruno Courcelle
1993 — conf
Recognizable Sets of Graphs of Bounded Tree-Width.
Dagstuhl Seminar on Graph Transformations in Computer Science
Bruno Courcelle, Jens Lagergren
1992 — conf
Monadic Second-Order Graph Transductions.
CAAP
Bruno Courcelle
1992 — ch.
Recognizable sets of unrooted trees.
Tree Automata and Languages
Bruno Courcelle
1992 J jnl
The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures.
Theor. Comput. Sci.
Bruno Courcelle
1992 J jnl
The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues.
RAIRO Theor. Informatics Appl.
Bruno Courcelle
1991 J jnl
A Geometrical View of the Determinization and Minimization of Finite-State Automata.
Math. Syst. Theory
Bruno Courcelle, Damian Niwinski, Andreas Podelski
1991 — conf
Graph grammars, monadic second-order logic and the theory of graph minors.
Graph Structure Theory
Bruno Courcelle
1991 B conf
Monadic Second-Order Evaluations on Tree-Decomposable Graphs.
WG
Bruno Courcelle, Mohamed Mosbah
1991 J jnl
On Constructing Obstruction Sets of Words.
Bull. EATCS
Bruno Courcelle
1991 J jnl
Recursive Queries and Context-free Graph Grammars.
Theor. Comput. Sci.
Bruno Courcelle
1991 J jnl
The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability.
Theor. Comput. Sci.
Bruno Courcelle
1990 — conf
An Algebraic Theory of Graph Reduction.
Graph-Grammars and Their Application to Computer Science
Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
1990 — conf
Context-free Handle-rewriting Hypergraph Grammars.
Graph-Grammars and Their Application to Computer Science
Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg
1990 — ch.
Graph Rewriting: An Algebraic and Logic Approach.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
Bruno Courcelle
1990 — conf
Graphs as Relational Structures: An Algebraic an Logical Approach.
Graph-Grammars and Their Application to Computer Science
Bruno Courcelle
1990 A* conf
On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract)
LICS
Bruno Courcelle
1990 — ch.
Recursive Applicative Program Schemes.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
Bruno Courcelle
1990 — conf
The Logical Exprssion of Graph Properties (Abstract).
Graph-Grammars and Their Application to Computer Science
Bruno Courcelle
1990 J jnl
The Monadic Second-Order Logic of Graphs IV: Definability Properties of Equational Graphs.
Ann. Pure Appl. Log.
Bruno Courcelle
1990 J jnl
The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs
Inf. Comput.
Bruno Courcelle
1989 B conf
Monadic Second-Order Logic and Context-Free Graph-Grammars.
MFCS
Bruno Courcelle
1989 A* conf
The Definability of Equational Graphs in Monadic Second-Order Logic.
ICALP
Bruno Courcelle
1989 J jnl
The Monadic Second-Order Logic of Graphs, II: Infinite Graphs of Bounded Width.
Math. Syst. Theory
Bruno Courcelle
1988 A conf
An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars.
STACS
Bruno Courcelle
1988 J jnl
Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming
Inf. Comput.
Bruno Courcelle, Pierre Deransart
1988 B conf
The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs.
WG
Bruno Courcelle
1987 J jnl
An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars.
Theor. Comput. Sci.
Bruno Courcelle
1987 J jnl
Decidable Subcases of The Equivalence Problem for Recursive Program Schemes.
RAIRO Theor. Informatics Appl.
Bruno Courcelle, Jean H. Gallier
1987 J jnl
Graph Expressions and Graph Rewritings.
Math. Syst. Theory
Michel Bauderon, Bruno Courcelle
1986 — conf
A representation of graphs by algebraic expressions and its use for graph rewriting systems.
Graph-Grammars and Their Application to Computer Science
Bruno Courcelle
1986 — conf
An Algebraic Formalism for Graphs.
CAAP
Michel Bauderon, Bruno Courcelle
1986 J jnl
Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars.
Theor. Comput. Sci.
Bruno Courcelle
1986 — conf
On context-free sets of graphs and their monadic second-order theory.
Graph-Grammars and Their Application to Computer Science
Bruno Courcelle
1985 A* conf
Equivalences and Transformations of Recursive Definitions
FOCS
Bruno Courcelle
1985 — conf
Proofs of partial correctness for iterative and recursive computations.
Logic Colloquium
Bruno Courcelle
1984 — ed.
CAAP'84, 9th Colloquium on Trees in Algebra and Programming, Bordeaux, France, March 5-7, 1984, Proceedings
CAAP
Bruno Courcelle
1984 J jnl
Définitions Récursives Par Cas.
RAIRO Theor. Informatics Appl.
Bruno Courcelle, F. Lavandier
1984 J jnl
Some Negative Results Concerning DPDA's.
Inf. Process. Lett.
Bruno Courcelle
1984 J jnl
The Solutions of Two Star-Height Problems for Regular Trees.
Theor. Comput. Sci.
Jean-Pierre Braquelaire, Bruno Courcelle
1984 — conf
The solution of two star height problems for regular trees.
Automata on Infinite Words
Jean-Pierre Braquelaire, Bruno Courcelle
1983 — conf
A Class of Program Schemes Based on Tree Rewriting Systems.
CAAP
Bruno Courcelle, F. Lavandier
1983 J jnl
An Axiomatic Approach to the Korenjak-Hopcroft Algorithms.
Math. Syst. Theory
Bruno Courcelle
1983 — conf
Attribute Grammars: Definitions, Analysis of Dependencies, Proof Methods.
Method and tools for compiler construction
Bruno Courcelle
1983 J jnl
Fundamental Properties of Infinite Trees.
Theor. Comput. Sci.
Bruno Courcelle
1982 J jnl
Attribute Grammars and Recursive Program Schemes I.
Theor. Comput. Sci.
Bruno Courcelle, Paul Franchi-Zannettacci
1982 J jnl
Attribute Grammars and Recursive Program Schemes II.
Theor. Comput. Sci.
Bruno Courcelle, Paul Franchi-Zannettacci
1982 J jnl
On the Equivalence Problem for Attribute Systems
Inf. Control.
Bruno Courcelle, Paul Franchi-Zannettacci
1981 A* conf
An Axiomatic Approach to the Korenjak-Hopcroft Algorithms.
ICALP
Bruno Courcelle
1981 — conf
Attribute Grammars: Theory and Applications.
ICFPC
Bruno Courcelle
1981 J jnl
The Rational Index: A Complexity Measure for Languages.
SIAM J. Comput.
Luc Boasson, Bruno Courcelle, Maurice Nivat
1981 J jnl
The Simultaneous Accessibility of Two Configurations of Two Equivalent DPDA's.
Inf. Process. Lett.
Bruno Courcelle
1980 J jnl
Completions of ordered magmas.
Fundam. Informaticae
Bruno Courcelle, Jean-Claude Raoult
1980 A* conf
On the Expressive Power of Attribute Grammars
FOCS
Bruno Courcelle, Paul Franchi-Zannettacci
1979 J jnl
Arbes infinis et systèmes d'équations.
RAIRO Theor. Informatics Appl.
Bruno Courcelle
1979 J jnl
Infinite Trees in Normal Form and Recursive Equations Having a Unique Solution.
Math. Syst. Theory
Bruno Courcelle
1978 J jnl
A Representation of Trees by Languages I.
Theor. Comput. Sci.
Bruno Courcelle
1978 J jnl
A Representation of Trees by Languages II.
Theor. Comput. Sci.
Bruno Courcelle
1978 J jnl
Frontiers of Infinite Trees.
RAIRO Theor. Informatics Appl.
Bruno Courcelle
1978 A* conf
On Recursive Equations Having a Unique Solution
FOCS
Bruno Courcelle
1978 J jnl
On Some Classes of Interpretations.
J. Comput. Syst. Sci.
Bruno Courcelle, Irène Guessarian
1978 B conf
The Algebraic Semantics of Recursive Program Schemes.
MFCS
Bruno Courcelle, Maurice Nivat
1977 J jnl
On Jump-Deterministic Pushdown Automata.
Math. Syst. Theory
Bruno Courcelle
1977 — conf
On a description of tree-languages by languages.
Theoretical Computer Science
Bruno Courcelle
1977 A* conf
On the Definition of Classes of Interpretations.
ICALP
Bruno Courcelle
1976 A* conf
Algebraic Families of Interpretations
FOCS
Bruno Courcelle, Maurice Nivat
1976 J jnl
Completeness Results for the Equivalence of Recursive Schemas.
J. Comput. Syst. Sci.
Bruno Courcelle, Jean Vuillemin
1976 A* conf
Program Equivalence and Canonical Forms in Stable Discrete Interpretations.
ICALP
Gérard Berry, Bruno Courcelle
1974 A* conf
Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples.
ICALP
Bruno Courcelle, Gilles Kahn, Jean Vuillemin
1974 — conf
Complétude d'un système formel pour prouver l'équivalence de certains schémas récursifs monadiques.
Symposium on Programming
Bruno Courcelle, Jean Vuillemin
1974 — conf
Recursive Schemes, Algebraic Trees and Deterministic Languages
SWAT
Bruno Courcelle
1974 A* conf
Semantics and Axiomatics of a Simple Recursive Language
STOC
Bruno Courcelle, Jean Vuillemin
1974 J jnl
Une forme canonique pour les grammaires simples déterministes.
RAIRO Theor. Informatics Appl.
Bruno Courcelle