PS-regular languages

被引：3

作者：

Wang, Shou-Feng ^{[1
,2
]}

Guo, Yu-Qi ^{[1
]}

Xu, Shao-Xian ^{[3
]}

机构：

[1] Southwest Univ, Sch Math & Stat, Chongqing 400715, Peoples R China

[2] Yunnan Normal Univ, Sch Math, Kunming 650092, Yunnan, Peoples R China

[3] Nanyang Normal Univ, Sch Math & Stat, Nanyang 473061, Henan, Peoples R China

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2011年 / 88卷 / 12期

关键词：

regular language; PS-regular language; P-regular language; S-regular language; prefix-suffix subset;

D O I：

10.1080/00207160.2010.548517

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, we introduce a class of generalized regular languages, namely PS-regular languages, and give some characterizations of such generalized regular languages. As applications of the results, we obtain some characterizations of regular languages. Also, we consider the closure properties of the class of PS-regular languages, and the relationship among PS-regular languages, context-free languages and context-sensitive languages.

引用

页码：2464 / 2484

页数：21