助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[6]条 当前为第1条到6条
 

相关语句
ω-有穷自动机
    In this paper,a type of Alternating ω-Finite Automata(abbrevinted ω-UAFA)issuggested,that is,all states of Alternating ω-Finite Automata are universal states,And by adoptingthe constr ucting methed ’it is shown that the class of ω-languages accepted by the ω-UAFA is equalto the class of ω-languages accepted by the simple ω-UAFA under C_1,C_2 , C_3 and C_4 accepting condi一tions.
    本文提出了一类交替的ω-有穷自动机(ω-UAFA),并采用了构造方法证明了ω-UAFA和简单的ω-UAFA在C_1、C_2、C_5和C_4接受条件下的等价性。
    A TYPE OF ALTERNATING ω-FINITE AUTOMATA
    一类交替的ω-有穷自动机
    THE EQUIVALENCE OF RECOGNIZING POWER FOR ONE TYPE OF ALTERNATING ω-FINITE AUTOMATA AND DETERMINISTIC ω-FINITE AUTOMATA
    一类交替的ω-有穷自动机和确定的ω-有穷自动机识别能力的等价性
    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.
    到目前为止,交替的ω-有穷自动机的接受条件仅有6种,本文给出了6种新形式的接受条件,并研究了交替的ω-有穷自动机在这些条件下识别语言的能力.最后给出了ω-自动机在各种接受条件下识别的语言类.
    In this paper, one type of alternating ω-finite automata (abbreviated ω-UAFA),that is, all states of alternating ω-finite automata are universal, is suggested. And by adopting the constructing method, it is shown that the ω-language class accepted by ω-UAFA is equal to the one accepted by deterministic ω-finite automata under four types of acceptance conditions.
    本文提出了一类交替的ω-有穷自动机,即所有状态都是万能的交替的ω-有穷自动机(记为ω-UAFA),并采用了构造的方法证明了ω-UAFA和确定的ω-有穷自动机在四种接受条件下接受的ω-语言的等价性。
    The purpose of the study of acceptance condition of ω-finite automata is to reveal recognition power of ω-finite automata and further division of the class of languages. Up till now,six types of acceptance conditions have been investigated. This paper suggests some new acceptance conditions and investigates the power accept ω-language under these conditions as ω-finite automata.
    关于ω- 有穷自动要的接受条件的研究,旨在揭示ω- 自动识别语言的能力以及对语言类作进一步的划分.到目前为止ω- 自动机的接受条件已有六种,本文给出了一些新形式的接受条件并且研究了ω- 有穷自动机在这些接受条件下接受ω- 语言的能力
 

首页上一页1下一页尾页 

 
CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社