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 条
  • [21] TRANSFORMATIONS IN CONTEXT-FREE LANGUAGES
    RADENSKY, AA
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1983, 36 (02): : 185 - 187
  • [22] Buchi context-free languages
    Esik, Zoltan
    Ivan, Szabolcs
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (8-10) : 805 - 821
  • [23] PARALLEL CONTEXT-FREE LANGUAGES
    SIROMONEY, R
    KRITHIVASAN, K
    INFORMATION AND CONTROL, 1974, 24 (02): : 155 - 162
  • [24] Superwords and context-free languages
    Dömösi, P
    PUBLICATIONES MATHEMATICAE-DEBRECEN, 2000, 56 (3-4): : 313 - 320
  • [25] A NOTE ON CONTEXT-FREE LANGUAGES
    WALTERS, RFC
    JOURNAL OF PURE AND APPLIED ALGEBRA, 1989, 62 (02) : 199 - 203
  • [26] Timed Context-Free Temporal Logics
    Bozzelli, Laura
    Murano, Aniello
    Peron, Adriano
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2018, (277): : 235 - 249
  • [27] Efficient recognition algorithms for parallel multiple context-free languages and for multiple context-free languages
    Nakanishi, R
    Takada, K
    Nii, H
    Seki, H
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1998, E81D (11) : 1148 - 1161
  • [28] INDUCTIVE INFERENCE OF CONTEXT-FREE LANGUAGES BASED ON CONTEXT-FREE EXPRESSIONS
    YOKOMORI, T
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 24 (02) : 115 - 140
  • [29] Fractal Automata: Recursion in Context-Free and in Deterministic and Linear Context-Free Languages
    Nagy, Benedek
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2025,
  • [30] On the Density of Context-Free and Counter Languages
    Eremondi, Joey
    Ibarra, Oscar H.
    McQuillan, Ian
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (02) : 233 - 250
12345