| 摘要: |
| 至今被公开的ω-有穷自动机的接受条件有6个即C1—C6，寻找新的接受条件和研究ω-有穷自动机关于新接受条件接受ω-语言的能力是ω-有穷自动机理论中的一个重要课题．本文定义了ω-有穷自动机的两个新的接受条件Z1和Z2，并且研究了：(1)ω-U—NFA关于Zi(i=1,2)接受 ω-语言的能力，得到了 N |
| 关键词: ω-有穷自动机，接受条件，ω-语言． |
| DOI： |
| 分类号: |
| 基金项目:本文是国家自然科学基金资助项目. |
|
| ON TWO TYPES NEW ACCEPTANCE CONDITlON OF ω-FINITE STATE AUTOMATA |
|
Zhou Wenjun,Su Jinxiang
|
| 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． |
| Key words: ω-finite state automata,acceptance condltion,ω-language． |
