## Graph Structure and Monadic Second-Order Logic: A by Professor Bruno Courcelle, Dr Joost Engelfriet

By Professor Bruno Courcelle, Dr Joost Engelfriet

The research of graph constitution has complicated in recent times with nice strides: finite graphs will be defined algebraically, allowing them to be developed out of extra simple parts. individually the houses of graphs might be studied in a logical language known as monadic second-order common sense. during this e-book, those gains of graph constitution are introduced jointly for the 1st time in a presentation that unifies and synthesizes learn over the past 25 years. the writer not just offers an intensive description of the idea, but in addition info its functions, at the one hand to the development of graph algorithms, and, at the different to the extension of formal language idea to finite graphs. accordingly the ebook could be of curiosity to graduate scholars and researchers in graph concept, finite version conception, formal language idea, and complexity idea.

Similar mathematics_1 books

Mathematics, Affect and Learning: Middle School Students' Beliefs and Attitudes About Mathematics Education

This e-book examines the ideals, attitudes, values and feelings of scholars in Years five to eight (aged 10 to fourteen years) approximately arithmetic and arithmetic schooling. essentially, this ebook specializes in the advance of affective perspectives and responses in the direction of arithmetic and arithmetic studying. moreover, apparently scholars improve their extra detrimental perspectives of arithmetic through the heart tuition years (Years five to 8), and so right here we be aware of scholars during this severe interval.

Extra info for Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach

Example text

If m ∈ T (F ∪ {x1 , . . , xn }) is the monomial of pi to which r(xi1 , . . , xiρ(r) ) corresponds, then xi1 , . . , xiρ(r) is the sequence of unknowns that occur in m. Furthermore, we impose that each r has a unique occurrence in S . The least solution of S in P(T (P))n defines the n-tuple of sets of derivation trees of S. Let F be the signature over which S is written, and M the F-algebra for which S is to be solved. The function M ρ(r) → M that interprets a symbol r in P is the one defined8 (in the usual sense) by the unique term tr in T (F ∪ {y1 , .

In particular dM = baaac. Clearly, L(G, S) = {tM | t ∈ K } and L(G, T ) = {tM | t ∈ L }. Thus, since a parsing algorithm for G produces derivation trees of G, it corresponds to a classical parsing algorithm of the context-free grammar G. The system G and the derivation trees of G represent the abstract syntax of the grammar G, whereas the P-algebra M represents its concrete syntax. It should be clear that the construction of G and M can be realized for every context-free grammar G. It should be noted, however, that the signature P and the algebra M both depend on G.

The F-algebra M is finite if M is finite. Let X = {x1 , . . , xn } be a set of unknowns (or variables), intended to denote subsets of M . , a term written with the symbols of F ∪ X and well formed with respect to arities (the unknowns are of arity 0). For each n-tuple (L1 , . . , Ln ) of subsets of M and each monomial m, the set m(L1 , . . , Ln ) is a subset of M . This subset is defined by taking xi = Li and by interpreting each function symbol f as fM , where, for all A1 , . . , Aρ( f ) ⊆ M : fM (A1 , .