On context-free sets of graphs and their monadic second-order theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 291 LNCS, Issue , 1987, Pages 133-146

  Courcelle, Bruno ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Context free graph grammar; Decision problem; Monadic second order logic

Indexed keywords

CONTEXT FREE GRAMMARS; CONTEXT SENSITIVE GRAMMARS; FORMAL LANGUAGES; FORMAL LOGIC; GRAPHIC METHODS;

ALGEBRAIC FRAMEWORK; CONTEXT-FREE; CONTEXT-FREE GRAPH GRAMMARS; DECISION PROBLEMS; EQUATIONAL SETS; MONADIC SECOND ORDER THEORY; MONADIC SECOND-ORDER LOGIC; SYSTEM OF EQUATIONS;

GRAPH THEORY;

EID: 26444481088     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-18771-5_50     Document Type: Conference Paper

References (6)

1. J.R. BUCHI, Weak 2nd order logic and finite automata, Z. Math Logik 5(960) 66–92.
2. B. COURCELLE, A representation of graphs by algebraic expressions and its use for graph rewriting systems, this volume.
3. B. COURCELLE, An axiomatic definition of context-free rewriting and its application to NLC grammars, Report 8706, Bordeaux 1 University, 1987.
4. J. DONER, Tree acceptors and applications. Jour. Comput. System Sci. 4(70) 406–451
5. J.W. THATCHER, J.B. WRIGHT, Generalized automata theory, Maths Systems Theory 2 (1970) 57–81
6. P. SEYMOUR, N. ROBERTSON, Some new results on the well quasiordering of graphs, Annals of Discrete Maths 23 (1984) 343–354.