( en | de | ru )

 

Disambiguation of "Courcelle, Bruno"

Author of the publication

copydeleteadd this publication to your clipboard
Recursive Applicative Program Schemes

. Handbook of Theoretical Computer Science: Formal Models and Semantics, B, chapter 9, MIT Press, Cambridge, MA, USA, (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Horst Bruno

Eugen Bruno

Armin Bruno

Axel Brunold

Horst Bruno

 

Other publications of authors with the same name

Proofs of Partial Correctness for Attribute Grammars with Application to Recursive Procedures and Logic Programming, and . Information and Computation, 78 (1): 1--55 (July 1988)Program Equivalence and Canonical Forms in Stable Discrete Interpretations., and . ICALP, page 168-188. Edinburgh University Press, (1976)Regularity Equals Monadic Second-Order Definability for Quasi-trees.. Fields of Logic and Computation II, volume 9300 of Lecture Notes in Computer Science, page 129-141. Springer, (2015)Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations.. FoSSaCS, volume 2303 of Lecture Notes in Computer Science, page 1-4. Springer, (2002)An Algebraic Formalism for Graphs., and . CAAP, volume 214 of Lecture Notes in Computer Science, page 74-84. Springer, (1986)Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey.. Developments in Language Theory, volume 3340 of Lecture Notes in Computer Science, page 1-11. Springer, (2004)The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic., and . CSL, volume 3634 of Lecture Notes in Computer Science, page 325-338. Springer, (2005)Graph Operations and Monadic Second-Order Logic: A Survey.. LPAR, volume 1955 of Lecture Notes in Computer Science, page 20-24. Springer, (2000)Automata for Monadic Second-Order Model-Checking.. RP, volume 6945 of Lecture Notes in Computer Science, page 26-27. Springer, (2011)Infinite Transducers on Terms Denoting Graphs., and . ELS, page 47-58. ELSAA, (2013)