|
软件学报 1995
THE CHARACTERIZATION FOR REGULAR LANGUAGES
|
Abstract:
Common pumping lemma for regular languages characterizes the necessary condition that a language is regular. This paper gives several necessary and sufficient conditions and common pumping lemma and generalized pumping lemma are obtained as their consequence.