助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   无限状态自动机 的翻译结果: 查询用时:0.327秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

无限状态自动机
相关语句
  “无限状态自动机”译为未确定词的双语例句
     Fuzzy Infinite Automaton and Its Convergence
     模糊无限状态自动机及其收敛性(英文)
     The Context Free Grammar and the Infinite-State Automaton
     上下文无关文法与无限状态自动机
短句来源
     At the same time, some corresponding extracted methods of fuzzy finite-state automaton (FFA) and fuzzy infinite-state automaton (FIA) is introduced, and the convergence of FIA is discussed and the equivalence of various automata are also discussed.
     相继引入了有效模糊有限自动机的抽取和模糊无限状态自动机的抽取方法,以及模糊无限自动机的收敛性和自动机种类中各种自动机的等价性处理框架,提出了有理论和实用参考价值的新方法,相应的计算机模拟结果证实了所提方法的有效性。 本文的主要贡献集中在以下几个方面。
短句来源
     However, the definition of infinite-state automaton is not introduced and the infinite-state automaton is not discussed for its stability and convergence.
     然而,关于无限状态自动机的定义及它的稳定性和收敛性都没有被讨论过。
     In this paper, fuzzy infinite-state automata that converge to fuzzy finite-state automata will be discussed by using discrete recurrent neural network and using the partition of output space of recurrent neural network, at the same time, the pseudo-gradient is used in our gradient update calculation.
     本文中,我们使用离散的反馈神经网络及网络输出空间划分方法,同时,在梯度更新算法中使用伪梯度方法,给出了模糊无限状态自动机收敛到模糊有限状态自动机的证明。
  相似匹配句对
     The Context Free Grammar and the Infinite-State Automaton
     上下文无关文法与无限状态自动机
短句来源
     Fuzzy Infinite Automaton and Its Convergence
     模糊无限状态自动机及其收敛性(英文)
     Measures and Martingales on Infinite State Spaces
     无限状态空间上的测度和鞅
短句来源
     Functions of Zero State of Linear Finite Automata
     线性有限自动机状态的作用
短句来源
     Modularization state automaton implements batch job execution.
     模块化的状态自动机实现了作业的执行。
短句来源
查询“无限状态自动机”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


At present, the context free grammar and the pushdown automaton are the usually used formal systems in research for context free languages, correspondently, the regular grammar and the finite automaton are usually used in research for regular languages. The correspondency between the symbols in regular grammar and the symbols in finite automaton is relatively evident. In other words,it is easier to transform one to the other between these two systems,and people may have a more accordant comprehension when they...

At present, the context free grammar and the pushdown automaton are the usually used formal systems in research for context free languages, correspondently, the regular grammar and the finite automaton are usually used in research for regular languages. The correspondency between the symbols in regular grammar and the symbols in finite automaton is relatively evident. In other words,it is easier to transform one to the other between these two systems,and people may have a more accordant comprehension when they observe the characteristics of a language in these two systems. But the correspondency between context free grammar and pushdown automaton is not so evident as that between regular grammar and finite automaton. The infinite state automaton introduced in this paper is also a kind of recognizing system for context free languages, however, there is also an evident correspondency between context free grammar and infinite state automaton similar to that between regular grammar and finite antomaton, thus bringing the benefits to the research of context free languages.

目前,在研究上下文无关语言时常用的形式系统是上下文无关文法和下推自动机,在研究正则语言时常用的形式系统是正则文法和有限状态自动机.正则文法中的符号和有限状态自动机的符号之间的对应关系比较明显,因此,两种系统之间的转换比较容易,并且在这两种系统中观察语言性质时,可以得到相对一致的解释,上下文无关文法与下推自动机之间的对应关系则不够明显,本文所介绍的无限状态自动机也是一种上下文无关语言的识别系统,但它对于上下文无关文法类似于有限状态自动机对于正则文法那样,相互符号间有较明显的对应关系,从而带来相应的好处.

>=The automata of fuzzy or defuzzization what we study are all finite-state automata so far. However, the definition of infinite-state automaton is not introduced and the infinite-state automaton is not discussed for its stability and convergence. In this paper, fuzzy infinite-state automata that converge to fuzzy finite-state automata will be discussed by using discrete recurrent neural network and using the partition of output space of recurrent neural network, at the same time, the pseudo-gradient is used...

>=The automata of fuzzy or defuzzization what we study are all finite-state automata so far. However, the definition of infinite-state automaton is not introduced and the infinite-state automaton is not discussed for its stability and convergence. In this paper, fuzzy infinite-state automata that converge to fuzzy finite-state automata will be discussed by using discrete recurrent neural network and using the partition of output space of recurrent neural network, at the same time, the pseudo-gradient is used in our gradient update calculation.

到目前为止,我们所研究的模糊或非模糊的自动机都是有限状态自动机。然而,关于无限状态自动机的定义及它的稳定性和收敛性都没有被讨论过。本文中,我们使用离散的反馈神经网络及网络输出空间划分方法,同时,在梯度更新算法中使用伪梯度方法,给出了模糊无限状态自动机收敛到模糊有限状态自动机的证明。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关无限状态自动机的内容
在知识搜索中查有关无限状态自动机的内容
在数字搜索中查有关无限状态自动机的内容
在概念知识元中查有关无限状态自动机的内容
在学术趋势中查有关无限状态自动机的内容
 
 

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