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

图标索引 历史查询
 

格值自动机
相关语句
  lattice-valued automata
    Pushdown Lattice-valued Automata and Fuzzy Systems
    下推格值自动机与模糊系统
短句来源
    Lattice-valued automata and their languages
    格值自动机与语言
短句来源
  lattice-valued automata
    Pushdown Lattice-valued Automata and Fuzzy Systems
    下推格值自动机与模糊系统
短句来源
    Lattice-valued automata and their languages
    格值自动机与语言
短句来源
  “格值自动机”译为未确定词的双语例句
    Automata with Truth Values in Lattice Moniod and Grammars
    格值自动机与格值正则文法
短句来源
    The main results are following:(1). Computing with words can be implemented by computing with values.
    (1).下推格值自动机基于词的计算可以通过基于值的计算实现。
短句来源
    (2). The equivalence of acceptance words by PDLA with final state and with empty stack is proved.
    (2).下推格值自动机以终态与以空栈两种接受词语言的方式是等价的。
短句来源
    (5). The equivalence of words language accepted by PDLA and generated by CFLG is proved.
    (5).下推格值自动机接受的词语言与上下文无关格值文法生成的词语言具有等价关系。
短句来源
查询“格值自动机”译词为用户自定义的双语例句

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


Latticevalued automata (LA) and their languages are introduced. The sufficient and necessary conditions for the extension of state transition function are given. The sufficient and necessary conditions for the equivalence of deterministic LA and LA are proved. Finally, the closeness of families of languages of LAs under regular operations are shown and some conditions for the closeness of families of languages of LAs under intersection and reversal operations are studied. The obtained results show the close...

Latticevalued automata (LA) and their languages are introduced. The sufficient and necessary conditions for the extension of state transition function are given. The sufficient and necessary conditions for the equivalence of deterministic LA and LA are proved. Finally, the closeness of families of languages of LAs under regular operations are shown and some conditions for the closeness of families of languages of LAs under intersection and reversal operations are studied. The obtained results show the close links between the LA and the algebraic properties of lattice monoid.

引入了格值自动机及其语言的概念,给出了格值自动机的状态转移函数可扩充的充分必要条件,证明了确定型格值自动机格值自动机等价的充分必要条件,研究了格值自动机的语言关于正则运算的封闭性及其条件.所得结论表明了格值自动机及其语言的特性与取值格代数性质的紧密联系.

The relationships between lattice_valued automata and grammars are disscused in this paper. And got the following results, for a given lattice_valued regular grammar, there exists a lattice_valued automation such that they accept the same language,and for a given lattice_valued automation, there is a lattice_valued regular grammar such that they accept the same language.

 给出了格值文法的定义与分类,对格值正则文法与自动机的关系作了详细讨论,得出了两个重要的结论,即:由给定的格值正则文法可以构造一个格值自动机使二者接受的语言集相同;反之亦然.

 
图标索引 相关查询

 


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

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