Recognizable sets of graphs, hypergraphs and relational structures: a survey

Authors:
Bruno Courcelle
Affiliations:
LABRI, Université Bordeaux 1 and CNRS, Talence, France
Venue:
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Year:
2004

Citing 2
Cited 5

Basic notions of universal algebra for language theory and graph grammars

Theoretical Computer Science
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations

The recognizability of sets of graphs is a robust property

Theoretical Computer Science
Formal Verification of Graph Grammars using Mathematical Induction

Electronic Notes in Theoretical Computer Science (ENTCS)
A quest for beauty and wealth (or, business processes for database researchers)

Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A structural/temporal query language for Business Processes

Journal of Computer and System Sciences
Verification of graph grammars using a logical approach

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly algebraic notions (equational and recognizable sets) and Monadic Second-Order logic (for defining sets and transformations of graphs, hypergraphs and relational structures) is reviewed. The lecture [3] is based on two submitted but nevertheless available articles [1,4] ; the present text is an informal overview. The numerous definitions and results can be found in the two articles.