微信服务号

微信订阅号

2025-5-17- 19
Home > Archive>Volume 5, Issue 9, 1994 >56-58
PDF HTML XML Export Cite reminder
ON ACCEPTANCE CONDITIONS OF ALTERNATING ω-FA
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [1]
    • |
  • Related
    • |
  • Cited by
    • | |
  • Comments
    Abstract:

    There are only six types of acceptance conditions for alternating ω-finite automata up till now. In this paper, six new forms of acceptance conditions are suggested and the power of accepting ω-language under these conditions for alternating ω-finite automata is investigated. At the end of the paper, the classes of languages accepted by ω-automata under various acceptance conditions are given.

    Reference
    1 Chandra A K，Kozen DC，Stockmeyer L J．Alternation．J．Assoc．Comput.，Mach.1981,28：114—113. 2 Miyano S，Hayashi T．Alternating finite automata on ω-words．Theoret.Comput.Sci.,1984,32：321—330. 3 Lindsay P A．On alternating ω—automata．J．Comput．Syst．Sci.,1988,36：16—24. 4 Wagner K．On ω—regular set．Inform．Contr．，1979，43：123—177.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

周清雷,周文俊,庄雷,苏锦祥.关于交替的ω─有穷自动机的接受条件.软件学报,1994,5(9):56-58

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 25,1993
  • Revised:January 13,1994
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2045239Visitors
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