ON TWO TYPES NEW ACCEPTANCE CONDITlON OF ω-FINITE STATE AUTOMATA
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Six acceptance conditions C1—C6 ofω-FA were known SO far.To look for some new acceptance condition of ω-FA and to study the power of ω-FA that accept ω-lan- guage with respect to the acceptance condition is one of hcart problem in theory of ω-finite state automata. This paper presents two types new acceptance condition Z1 and Z2 of ω-FA.The authors investigate(1)the power of ω-U-NFA that accept ω-language with re-spect to Zi(i=1,2)and derive Nsc3∈Nsz2=Nsz1=Nsz1(2)the power ofω-NFA that ac.cept ω-language with respect to Zi(i=1,2)and obtain Nc1∈Nz1∈Nz2.Some analogue results are dorrect with ω-DFA.

    Reference
    Related
    Cited by
Get Citation

周文俊,苏锦祥.关于有ω-穷自动机的两个新的接受条件*.软件学报,1995,6(zk):132-137

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 09,1994
  • Revised:March 09,1994
  • 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