A polynomial time extension of parallel multiple context-free grammar

被引：2
|
作者：
Ljunglöf, P
机构：
[1] Univ Gothenburg, Dept Comp Sci, SE-41296 Gothenburg, Sweden
[2] Chalmers Univ Technol, SE-41296 Gothenburg, Sweden
来源：
LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS, PROCEEDINGS | 2005年 / 3492卷
关键词：
D O I：
10.1007/11422532_12
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
It is already known that parallel multiple context-free grammar (PMCFC) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and range concatenation grammar (RCG) [4, 5]. In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], PMCFG becomes equivalent to sLMG and RCG. As a corollary we get that PMCFG with intersection describe exactly the class of languages recognizable in polynomial time.
引用
收藏
页码：177 / 188
页数：12
相关论文
共 50 条
  • [31] INFINITE WORDS GENERATED BY CONTEXT-FREE GRAMMAR
    NIVAT, M
    RAIRO-INFORMATIQUE-COMPUTER SCIENCE, 1977, 11 (04): : 311 - 327
  • [32] CONTROL SETS ON CONTEXT-FREE GRAMMAR FORMS
    GREIBACH, SA
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1977, 15 (01) : 35 - 98
  • [33] Unsupervised Statistical Learning of Context-free Grammar
    Unold, Olgierd
    Gabor, Mateusz
    Wieczorek, Wojciech
    ICAART: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2020, : 431 - 438
  • [34] 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):
  • [35] The omphalos context-free grammar learning competition
    Starkie, B
    Coste, F
    van Zaanen, M
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 16 - 27
  • [36] ELIMINATION OF LEFT RECURSION IN CONTEXT-FREE GRAMMAR
    BORDIER, J
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 145 - 162
  • [37] ELIMINATION OF LOEFT RECURSIVITY IN A CONTEXT-FREE GRAMMAR
    BORDIER, J
    REVUE FRANCAISE D INFORMATIQUE DE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 145 - &
  • [38] DESCRIPTIONAL COMPLEXITY OF CONTEXT-FREE GRAMMAR FORMS
    CSUHAJVARJU, E
    KELEMENOVA, A
    THEORETICAL COMPUTER SCIENCE, 1993, 112 (02) : 277 - 289
  • [39] Statistical Parsing with Context-Free Filtering Grammar
    Demko, Michael
    Penn, Gerald
    ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5549 : 52 - +
  • [40] On an extension of the class of context-free languages
    Dubasova, OA
    Melnikov, BF
    PROGRAMMING AND COMPUTER SOFTWARE, 1995, 21 (06) : 299 - 306
12345