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 条
12345