THE CHARACTERIZATION FOR REGULAR LANGUAGES
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

叶瑞芬,沈百英.正则语言的特征性质.软件学报,1995,6(7):416-419

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 23,1993
  • Revised:October 05,1993
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063