Logical description of context-free graph languages

被引：16
|
作者：
Engelfriet, J [1 ]
van Oostrom, V [1 ]
机构：
[1] Leiden Univ, Dept Comp Sci, NL-2300 RA Leiden, Netherlands
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1997年 / 55卷 / 03期
关键词：
D O I：
10.1006/jcss.1997.1510
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A graph language L is in the class C-edNCE of context-free edNCE graph languages if and only if L = f(T) where f is a partial function on graphs that can be defined in monadic second-order logic and T is the set of all trees over some ranked alphabet. This logical characterization implies a large number of closure and decidability properties of the context-free edNCE graph languages. Rather than context-free graph grammars we use regular path descriptions to define graph languages. (C) 1997 Academic Press.
引用
收藏
页码：489 / 503
页数：15
相关论文
共 50 条
  • [21] ON REGULARITY OF CONTEXT-FREE LANGUAGES
    EHRENFEUCHT, A
    HAUSSLER, D
    ROZENBERG, G
    THEORETICAL COMPUTER SCIENCE, 1983, 27 (03) : 311 - 332
  • [22] Logics for context-free languages
    Lautemann, C
    Schwentick, T
    Therien, D
    COMPUTER SCIENCE LOGIC, 1995, 933 : 205 - 216
  • [23] Characterization of context-free languages
    Badano, M.
    Vaggione, D.
    THEORETICAL COMPUTER SCIENCE, 2017, 676 : 92 - 96
  • [24] On strongly context-free languages
    Ilie, L
    Paun, G
    Rozenberg, G
    Salomaa, A
    DISCRETE APPLIED MATHEMATICS, 2000, 103 (1-3) : 153 - 165
  • [25] On polyslender context-free languages
    Dömösi, P
    Martin-Vide, C
    Mateescu, A
    PUBLICATIONES MATHEMATICAE-DEBRECEN, 2005, 66 (1-2): : 1 - 15
  • [26] CHARACTERIZATION OF CONTEXT-FREE LANGUAGES
    DEGALLEGO, MS
    ANNALES DE LA SOCIETE SCIENTIFIQUE DE BRUXELLES SERIES 1-SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1979, 93 (03): : 155 - 158
  • [27] QUOTIENTS OF CONTEXT-FREE LANGUAGES
    GINSBURG, S
    SPANIER, EH
    JOURNAL OF THE ACM, 1963, 10 (04) : 487 - &
  • [28] BICENTERS OF CONTEXT-FREE LANGUAGES
    AUTEBERT, JM
    BEAUQUIER, J
    BOASSON, L
    GIRE, F
    ACTA INFORMATICA, 1984, 21 (02) : 209 - 227
  • [29] ERASABLE CONTEXT-FREE LANGUAGES
    GREIBACH, SA
    INFORMATION AND CONTROL, 1975, 29 (04): : 301 - 326
  • [30] STOCHASTIC CONTEXT-FREE LANGUAGES
    HUANG, T
    FU, KS
    INFORMATION SCIENCES, 1971, 3 (03) : 201 - &
12345