GENERALIZED FORBIDDING GRAMMARS

被引:17
|
作者
MEDUNA, A
机构
[1] Computer Science Department, University of Missouri-Columbia, Columbia
关键词
forbidding grammars; Formal language theory; regulated rewriting;
D O I
10.1080/00207169008803908
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Each production of a generalized forbidding grammar has an associated finite set of words. Such a production can be applied only if none of its associated words is a substring of a given rewritten sentential form. It is shown that these grammars with productions having associated only words consisting of one or two symbols characterize type 0 languages. © 1990, Taylor & Francis Group, LLC. All rights reserved.
引用
收藏
页码:31 / 38
页数:8
相关论文
共 50 条
  • [41] A Valediction:Forbidding Mourning
    John Donne
    高中生, 2009, (01) : 68 - 68
  • [42] Forbidding and enforcing on graphs
    Genova, Daniela
    Jonoska, Natasa
    THEORETICAL COMPUTER SCIENCE, 2012, 429 : 108 - 117
  • [43] The Problems with Forbidding Science
    Marchant, Gary E.
    Pope, Lynda L.
    SCIENCE AND ENGINEERING ETHICS, 2009, 15 (03) : 375 - 394
  • [45] The Problems with Forbidding Science
    Gary E. Marchant
    Lynda L. Pope
    Science and Engineering Ethics, 2009, 15 : 375 - 394
  • [46] A VALEDICTION: FORBIDDING MOURNING
    Donne, John
    SINN UND FORM, 2011, 63 (06): : 776 - 777
  • [47] Forbidding undesirable agreements
    Turrini, Paolo
    Grossi, Davide
    Broersen, Jan
    Meyer, John-Jules Ch.
    JOURNAL OF LOGIC AND COMPUTATION, 2015, 25 (01) : 159 - 178
  • [48] Forbidding Wrong in Islam: An Introduction
    Sumar, Afzal
    JOURNAL OF SHIA ISLAMIC STUDIES, 2013, 6 (04) : 492 - 499
  • [49] RECONSTRUCTION OF RELATIONS DEFINED BY FORBIDDING
    BASSOGERBELLI, M
    ILLE, P
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1993, 316 (12): : 1229 - 1234
  • [50] Forbidding Complete Hypergraphs as Traces
    Dhruv Mubayi
    Yi Zhao
    Graphs and Combinatorics, 2007, 23 : 667 - 679