메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 1373 LNCS, Issue , 1998, Pages 618-628
Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width
Author keywords

[No Author keywords available]
Indexed keywords

DEFINABILITY; FINITE GRAPHS; MONADIC SECOND-ORDER LOGIC; RECOGNIZABLE SETS; SECOND ORDERS; TREE-WIDTH;
EID: 78649882717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028596     Document Type: Conference Paper
Times cited : (39)
References (12)
  • 1
    • 0003160921 scopus 로고
    • Graph expressions and graph rewritings
    • M. Bauderon and B. Courcelle. Graph expressions and graph rewritings. Math. Systems Theory, 20:83-127, 1987.
    • (1987) Math. Systems Theory , vol.20 , pp. 83-127
    • Bauderon, M.1    Courcelle, B.2
  • 2
    • 70350098746 scopus 로고
    • Weak second order logic and finite automata
    • J. Büchi. Weak second order logic and finite automata. S. Math. Logik Grundlagen Math., 5:66-92, 1960.
    • (1960) S. Math. Logik Grundlagen Math. , vol.5 , pp. 66-92
    • Büchi, J.1
  • 3
    • 0025398865 scopus 로고
    • The monadic second order logic of graphs, I: Recognizable sets of finite graphs
    • B. Courcelle. The monadic second order logic of graphs, I : Recognizable sets of finite graphs. Inf. and Comp., 85:12-75, 1990.
    • (1990) Inf. and Comp. , vol.85 , pp. 12-75
    • Courcelle, B.1
  • 4
    • 44949288298 scopus 로고
    • The monadic second-order logic of graphs, IV: Definability properties of equational graphs
    • B. Courcelle. The monadic second-order logic of graphs, IV : Definability properties of equational graphs. Annals of Pure and Applied Logic, 49:193-255, 1990.
    • (1990) Annals of Pure and Applied Logic , vol.49 , pp. 193-255
    • Courcelle, B.1
  • 5
    • 0026123837 scopus 로고
    • The monadic second-order logic of graphs, V: On closing the gap between definability and recognizability
    • B. Courcelle. The monadic second-order logic of graphs, V : On closing the gap between definability and recognizability. Theoret. Comput. Sci., 80:153-202, 1991.
    • (1991) Theoret. Comput. Sci. , vol.80 , pp. 153-202
    • Courcelle, B.1
  • 6
    • 0028420231 scopus 로고
    • Monadic second order definable graph transductions: A survey
    • B. Courcelle. Monadic second order definable graph transductions : A survey. Theoret. Comput. Sci., 126:53-75, 1994.
    • (1994) Theoret. Comput. Sci. , vol.126 , pp. 53-75
    • Courcelle, B.1
  • 7
    • 0000185443 scopus 로고
    • Tree acceptors and some of their applications
    • J. Doner. Tree acceptors and some of their applications. J. Comput. System Sci., 4:406-451, 1970.
    • (1970) J. Comput. System Sci. , vol.4 , pp. 406-451
    • Doner, J.1
  • 8
    • 84976723866 scopus 로고
    • May we introduce to you, hyperedge replacement
    • A. Habel and H.-J. Kreowski. May we introduce to you, hyperedge replacement. LNCS 291, pages 15-28, 1987.
    • (1987) LNCS , vol.291 , pp. 15-28
    • Habel, A.1    Kreowski, H.-J.2
  • 9
    • 84951085310 scopus 로고    scopus 로고
    • Recognizability equals definability for partial k-trees
    • V. Kabanets. Recognizability equals definability for partial k-trees. In ICALP '97, pages 805-815, 1997.
    • (1997) ICALP '97 , pp. 805-815
    • Kabanets, V.1
  • 10
    • 84896692694 scopus 로고    scopus 로고
    • Definability equals recognizability of partial 3-trees
    • (WG '96), editor
    • D. Kaller. Definability equals recognizability of partial 3-trees. In (WG '96), editor, Workshop on Graph-Theoretic Concepts in Computer Science, pages 239-253, 1996.
    • (1996) Workshop on Graph-Theoretic Concepts in Computer Science , pp. 239-253
    • Kaller, D.1
  • 11
    • 0002718609 scopus 로고
    • Algebraic automata and context-free sets
    • J. Mezei and J. Wright. Algebraic automata and context-free sets. Inform. and Control, 11:3-29, 1967.
    • (1967) Inform. and Control , vol.11 , pp. 3-29
    • Mezei, J.1    Wright, J.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.