Skip to main content Accessibility help
×
×
Home

Recognizable sets of graphs: equivalent definitions and closure properties

  • Bruno Courcelle (a1)
Abstract

The notion of a recognizable set of words, trees or graphs is relative to an algebraic structure on the set of words, trees or graphs respectively. We establish that several algebraic structures yield the same notion of a recognizable set of graphs. This notion is equivalent to that of a fully cutset-regular set of graphs introduced by Fellows and Abrahamson. We also establish that the class of recognizable sets of graphs is closed under the operations considered in these various equivalent definitions. This fact is not a standard consequence of the definition of recognizability.

Copyright
References
Hide All
Abrahamson, K. and Fellows, M. (1993) Finite automata, bounded tree-width and wellquasiordering. In: Robertson, N. and Seymour, P. (eds.) Graph structure theory. Contemporary Mathematics 147 539564.
Arnborg, S., Courcelle, B., Proskurowski, A. and Seese, D. (1991a) An algebraic theory of graph reduction. Report 91–36, Bordeaux-1 University. (Short version in Springer- Verlag Lecture Notes in Computer Science 532 7083; full paper to appear in J. ACM.)
Arnborg, S., Lagergren, J. and Seese, D. (1991b) Easy problems for tree decomposable graphs. J. of Algorithms 12 308340.
Arnold, A. and Niwinski, D. (1992) Fixed point characterization of weak monadic logic definable sets of trees. In: Nivat, M. and Podelski, A. (eds.) Tree automata and languages, Elsevier159188.
Bauderon, M. and Courcelle, B. (1987) Graph expressions and graph rewritings. Mathematical Systems Theory 20 83127.
Courcelle, B. (1986) Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars. Theor. Comp. Sci. 42 1122.
Courcelle, B. (1987) An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theor. Comput. Sci. 55 141181.
Courcelle, B. (1989) On Recognizable sets and tree automata. In: Nivat, M. and Ait-Kaci, H. (eds.) Resolution of equations in Algebraic Structures, Vol. 1, Academic Press 93126.
Courcelle, B. (1990a) The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85 1275.
Courcelle, B. (1990b) Graph rewriting: An algebraic and logic approach. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B, Elsevier, 193242.
Courcelle, B. (1991) The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theor. Comp. Sci. 80 153202.
Courcelle, B. (1992) The monadic second order logic of graphs VII: Graph as relational structures. Theor. Comp. Sci. 101 333.
Courcelle, B. (1993) Graph grammars, monadic second-order logic and the theory of graph minors. In: Robertson, N. and Seymour, P. (eds.) Graph structure theory. Contemporary Mathematics 147 565590.
Courcelle, B., Engelfriet, J. and Rozenberg, G. (1993) Handle-rewriting hypergraph grammars. J. Comput. System. Sci. 46 218270.
Courcelle, B. and Lagergren, J. (1992). Recognizable sets of graphs of bounded tree-width. Report 92–68, Bordeaux-1 University. (Springer-Verlag Lecture Notes in Computer Science, to appear).
Ehrig, H. and Mahr, B. (1985) Fundamentals of algebraic specifications I, Springer-Verlag.
Eilenberg, S. (1974). Automata, languages and machines, Vol. A, Academic Press, New York.
Fellows, M. and Abrahamson, K. (1993) Cutset-regularity beats well-quasi ordering for bounded treewidth. In: Seymour, P. and Robertson, N. (eds.) Proceedings of the Graph Minors Conference, AMS.
Gegsec, F. and Steinby, M. 1984 Tree automata, Akademiai Kiado, Budapest.
Habel, A. (1992) Hyperedge replacement: grammar and languages. Springer-Verlag Lecture Notes In Computer Science. 643.
Habel, A., Kreowski, H.-J. and Lautemann, C. (1993) A comparison of compatible, finite and inductive graph properties. Theor. Comp. Sci. 110 145168.
Lengauer, T. and Wanke, E. (1988) Efficient analysis of graph properties on context-free graph languages, Proceedings ICALP '88. Springer-Verlag Lecture Notes in Computer Science 317 379393.
Mezei, J. and Wright, J. (1967) Algebraic automata and context-free sets. Information and Control 11 329.
Wechler, W. (1991) Universal algebra for computer scientists. Springer-Verlag.
Wirsing, M. (1990) Algebraic specifications. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B, Elsevier675779.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed