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 条
  • [1] Parallel Contextual Array Insertion Deletion Grammar and (Context-Free : Context-Free) Matrix Grammar
    Jayasankar, S.
    Thomas, D. G.
    Immanuel, S. James
    Paramasivan, Meenakshi
    Robinson, T.
    Nagar, Atulya K.
    COMBINATORIAL IMAGE ANALYSIS, IWCIA 2020, 2020, 12148 : 147 - 163
  • [2] PARALLEL CONTEXT-FREE ARRAY GRAMMAR NORMAL FORMS
    WANG, PSP
    COMPUTER GRAPHICS AND IMAGE PROCESSING, 1981, 15 (03): : 296 - 300
  • [3] 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
  • [4] On the computational completeness of context-free parallel communicating grammar systems
    Csuhaj-Varjú, E
    Vaszil, G
    THEORETICAL COMPUTER SCIENCE, 1999, 215 (1-2) : 349 - 358
  • [5] On the computational complexity of context-free parallel communicating grammar systems
    Bruda, S
    NEW TRENDS IN FORMAL LANGUAGES, 1997, 1218 : 256 - 266
  • [6] UNIVERSAL CONTEXT-FREE GRAMMAR
    KASAI, T
    INFORMATION AND CONTROL, 1975, 28 (01): : 30 - 34
  • [7] CONTEXT-FREE GRAMMAR FORMS
    CREMERS, A
    GINSBURG, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 11 (01) : 86 - 117
  • [8] Grammar compression with probabilistic context-free grammar
    Naganuma, Hiroaki
    Hendrian, Diptarama
    Yoshinaka, Ryo
    Shinohara, Ayumi
    Kobayashi, Naoki
    2020 DATA COMPRESSION CONFERENCE (DCC 2020), 2020, : 386 - 386
  • [9] Distributional learning of parallel multiple context-free grammars
    Clark, Alexander
    Yoshinaka, Ryo
    MACHINE LEARNING, 2014, 96 (1-2) : 5 - 31
  • [10] Distributional learning of parallel multiple context-free grammars
    Alexander Clark
    Ryo Yoshinaka
    Machine Learning, 2014, 96 : 5 - 31
12345