The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

Arnborg, 1988, Problems easy for tree decomposable graphs, Vol. 317, 38

Bauderon, 1987, Graph expressions and graph rewritings, Math. Systems Theory, 20, 83, 10.1007/BF01692060

Bodlaender, 1988, Dynamic programming on graphs with bounded tree width, Vol. 317, 105

Büchi, 1960, Weak 2nd order logic and finite automata, Z. Math. Logik Gründlag. Math., 5, 66, 10.1002/malq.19600060105

Courcelle, 1986, Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, Theoret. Comput. Sci., 42, 1, 10.1016/0304-3975(86)90050-2

Courcelle, 1987, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci., 55, 141, 10.1016/0304-3975(87)90102-2

Courcelle, 1987, A representation of graph by algebraic expressions and its use for graph rewriting systems, Vol. 291, 112

Courcelle, 1987, On context-free sets of graphs and their monadic second order theory, Vol. 291, 133

Courcelle, 1988, On using context-free graph grammars for analyzing recursive definitions, 83

Courcelle, 1989, On recognizable sets and tree automata

Courcelle, B. (in press), Graph rewriting: an algebraic and logical approach, in “Handbook of Theoretical Computer Science” (J. Van Leeuwen, Ed.), Elsevier, Amsterdam.

Courcelle, 1989, The monadic second-order logic of graphs: Definable sets of finite graphs, Vol. 344, 30

Courcelle, 1989, The monadic second-order logic of graphs. II. Infinite graphs of bounded width, Math. Systems Theory, 21, 187, 10.1007/BF02088013

Courcelle, 1988

Courcelle, 1988, The Monadic Second-Order Logic of Graphs. IV. Every Equational Graph Is Definable

Doner, 1970, Tree acceptors and some of their applications, J. Comput. System Sci., 4, 406, 10.1016/S0022-0000(70)80041-1

Ehrig, 1985

Eilenberg, 1967, Automata in general algebras, Inform. and Control, 11, 52, 10.1016/S0019-9958(67)90670-5

Gaifmann, 1981, Local and non-local properties, 105

Gecseg, 1984

Habel, 1987, May we introduce to you, Hyperedge replacement, Vol. 291, 15

Johnson, 1985, The NP-completeness column: An on-going guide (16th), J. Algorithms, 6, 434, 10.1016/0196-6774(85)90012-4

Lautemann, 1988, Efficient algorithms on context-free graph grammars, Vol. 317, 362

Lengauer, 1988, Efficient analysis of graph properties on context-free graph languages, Vol. 317, 379

Mezei, 1967, Algebraic automata and context-free sets, Inform. and Control, 11, 3, 10.1016/S0019-9958(67)90353-1

Rozenberg, 1980

Seese, 1975, Ein Unentscheidbarkeitskriterium, Wiss. Z. Humbold-Univ. Berlin Math.-Natur. Reich, 24, 772

Seese, D. (in press), The structure of the models of decidable monadic theories of graphs, Annals of Pure Appl. Logic.

Thomas, W. (in press), Automata on infinite objects, in “Handbook of Theoretical Computer Science” (J. Van Leeuwen, Ed.), Elsevier, Amsterdam.

Trahtenbrot, 1950, Impossibility of an algorithm for the decision problem on finite classes, Dokl. Nauk. SSSR, 70, 569

Wirsing, M. (in press), Algebraic specification, in “Handbook of Theoretical Computer Science” (J. Van Leeuwen, Ed.), Elsevier, Amsterdam.