2011•International Journal of Computer MathematicsRequires access

𝒫𝒮-regular languages

Shoufeng Wang, Yuqi Guo, Shao-Xian Xu

Abstract

In this paper, we introduce a class of generalized regular languages, namely 𝒫𝒮-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 𝒫𝒮-regular languages, and the relationship among 𝒫𝒮-regular languages, context-free languages and context-sensitive languages.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Abstract family of languages, Regular language, Mathematics, Pumping lemma for regular languages, Closure (psychology), Cone (formal languages), Class (philosophy), Context (archaeology)