Logics for context-free languages

被引:0
|
作者
Lautemann, C
Schwentick, T
Therien, D
机构
[1] MCGILL UNIV,MONTREAL,PQ,CANADA
[2] UNIV POLITECN CATALUNYA,E-08028 BARCELONA,SPAIN
来源
COMPUTER SCIENCE LOGIC | 1995年 / 933卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We define matchings, and show that they capture the essence of context-freeness. More precisely, we show that the class of context-free languages coincides with the class of those sets of strings which call be defined by sentences of the form There Exists b phi, where phi is first order, b is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.
引用
收藏
页码:205 / 216
页数:12
相关论文
共 50 条
  • [31] CONTEXT-FREE COMPLEXITY OF FINITE LANGUAGES
    BUCHER, W
    MAURER, HA
    CULIK, K
    THEORETICAL COMPUTER SCIENCE, 1984, 28 (03) : 277 - 285
  • [32] Context-free grammars and XML languages
    Bertoni, Alberto
    Choffrut, Christian
    Palano, Beatrice
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 108 - 119
  • [33] AN INTERCHANGE LEMMA FOR CONTEXT-FREE LANGUAGES
    OGDEN, W
    ROSS, RJ
    WINKLMANN, K
    SIAM JOURNAL ON COMPUTING, 1985, 14 (02) : 410 - 415
  • [35] ON THE DEGREE OF NONREGULARITY OF CONTEXT-FREE LANGUAGES
    DASSOW, J
    PAUN, G
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1990, 36 (1-2) : 13 - 29
  • [36] The growth function of context-free languages
    Incitti, R
    THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2) : 601 - 605
  • [37] Immunity and pseudorandomness of context-free languages
    Yamakami, Tomoyuki
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (45) : 6432 - 6450
  • [38] The Context-Free Grammars of Artificial Languages
    Gribova, V. V.
    Kleschev, A. S.
    Krylov, D. A.
    AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS, 2013, 47 (02) : 59 - 67
  • [39] On the Density of Context-Free and Counter Languages
    Eremondi, Joey
    Ibarra, Oscar H.
    McQuillan, Ian
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 228 - 239
  • [40] On an Extension of the Class of Context-Free Languages
    Dubasova, O. A.
    Mel'nikov, B. E.
    Programming and Computer Software (English Translation of Programmirovanie), 21 (06):