GENERALIZED FORBIDDING GRAMMARS

被引：17
|
作者：
MEDUNA, A
机构：
[1] Computer Science Department, University of Missouri-Columbia, Columbia
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1990年 / 36卷 / 1-2期
关键词：
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 条
  • [1] Descriptional complexity of generalized forbidding grammars
    Meduna, A
    Svec, M
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (01) : 11 - 17
  • [2] Generalized one-sided forbidding grammars
    Meduna, Alexander
    Zemek, Petr
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2013, 90 (02) : 172 - 182
  • [3] Improved Descriptional Complexity Results on Generalized Forbidding Grammars
    Fernau, Henning
    Kuppusamy, Lakshmanan
    Oladede, Rufus O.
    Raman, Indhumathi
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2019, 2019, 11394 : 174 - 188
  • [4] Improved descriptional complexity results on generalized forbidding grammars
    Fernau, Henning
    Kuppusamy, Lakshmanan
    Oladele, Rufus O.
    Raman, Indhumathi
    DISCRETE APPLIED MATHEMATICS, 2022, 319 : 2 - 18
  • [5] One-sided forbidding grammars and selective substitution grammars
    Meduna, Alexander
    Zemek, Petr
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2012, 89 (05) : 586 - 596
  • [6] Forbidding ET0L grammars
    Meduna, A
    Svec, M
    THEORETICAL COMPUTER SCIENCE, 2003, 306 (1-3) : 449 - 469
  • [7] A hierarchy result for random forbidding context picture grammars
    Ewert, S
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 1999, 13 (07) : 997 - 1007
  • [8] ADDING GLOBAL FORBIDDING CONTEXT TO CONTEXT-FREE GRAMMARS
    EHRENFEUCHT, A
    KLEIJN, HCM
    ROZENBERG, G
    THEORETICAL COMPUTER SCIENCE, 1985, 37 (03) : 337 - 360
  • [9] On the computational completeness of generalized forbidding matrix
    Fernau, Henning
    Kuppusamy, Lakshmanan
    Raman, Indhumathi
    THEORETICAL COMPUTER SCIENCE, 2024, 999
  • [10] Generalized minimalist grammars
    Gutiérrez-Rexach, J
    ISSUES IN MATHEMATICAL LINGUISTICS, 1999, 47 : 19 - 52
12345