期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

状态机变换半群的可分性

The Separability of State Machine Transformation Semigroup
在线阅读 下载PDF
导出
摘要 在状态机的讨论中,覆盖问题和分解问题是讨论的主要方面。对于一个比较复杂的状态机要想找到的它的覆盖和分解一般是比较困难的,如果一个复杂的状态机具有可分性,我们就可以把它分成若干简单的状态机,从而解决它的覆盖和分解问题。本文主要讨论状态机变换半群的可分性,而状态机变换半群的可分性与它对应的状态机的可分性是一致的,从而解决状态机的可分性问题。 The covering problems and decomposition problems are mainly discussed in the discussion of the state machine. For a complex state machine, it is always difficult to find its coverage and decomposition, if the complex state machine is separable, we can divide it into a number of simple state machine, so as to solve its covering problems and decomposition problems. In this paper, the separability of state machine transformation semigroup is mainly discussed, because the separability of state machine transformation semigroup and the separability of its corresponding state machine are consistent, so as to solve the divisibility problem of＇the state machine.
作者 吴宗显 姚廷富 汪天友
机构地区 贵阳学院数学与信息科学学院
出处 《贵阳学院学报（自然科学版）》 2015年第2期22-25,共4页 Journal of Guiyang University：Natural Sciences
基金 贵州省科学技术基金项目:"模糊树自动机的研究及应用"(项目编号:黔科合J字LKG[2013]30号2013-2016)阶段性成果 贵阳学院数信学院重点课程项目"高等代数与解析几何" 贵阳学院教学团队建设项目(数学建模教学团队 应用数学教学团队)资助
关键词 状态机 状态机变换半群 循环变换半群 可分性 The state machine state machine transformation semigroup cyclic transformation semigroup separability
分类号 TP330.11 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献9

  • 1W. M. L. Holocombe. Algebraic Automata Theory [ M ]. Cambridge University press, Cambridge, 1982.
  • 2Oded Maler, A decomposition theorem for probabilistic transition systems [ J ], Theoretical Cmputer Science 145 ( 1995 ) :391 - 396.
  • 3K. Krohn and J. L. Rhodes. Algebraic theory of machines [ J ], I. principles of finite semigroups and machines, Trans. Amer. Math. Soc. 116 ( 1965 ) :450 -464.
  • 4L. Mora - L6pez, J. Mora, R. Morales - Bueno, M. Sidrach - de - Cardona. Modeling time series of climatic parame- ters with probabilistic finite automata [ J ], Environmental Modlling&Software 20 (2005) :753 - 760.
  • 5Dowen Qiu, Huaiqing Wang. A probabilistic model of com- puting with word[ J ] , Journel of Computer and System Sci- ences 70 ( 2005 ) : 176 - 200.
  • 6L. Mora - Lopez, M. Sidrach - de - Cardona. Using proba- bilistic finite Automata to simulate hourly series of global radiation [ J ], Solar Energy 74 ( 2003 ) :235 - 244.
  • 7Hoperoft JE.自动机理论、语言和计算导论(第二版)[M].刘田,等,译.北京:机械工业出版社,2004.
  • 8吴宗显,邓培民,易忠.概率有限自动机的商和同态[J].工程数学学报,2009,26(5):936-940. 被引量：3
  • 9吴宗显,邓培民,易忠.概率有限自动机的积和分解[J].计算机工程与应用,2009,45(15):47-50. 被引量：2

二级参考文献12

  • 1Maler O.A decomposition theorem for probabilistic transition systems[J].Theoretical Cmputer Science, 1995,145:391-396.
  • 2Holocombe W M L.Algebraic automata theory[M].Cambridge:Cambridge University Press, 1982.
  • 3Krohn K,Rhodes J L.Algebraic theory of maehines,I.prineiples of finite semigroups and machines[J].Trans Amer Math Soc,1965,116: 450-464.
  • 4Mora-Lepez L,Mora J,Morales-Bueno R,et al.Modeling time series of climatic parameters with probabilistic finite automata[J]. Environmental Modlling & Software, 2005,20: 753-760.
  • 5Qiu D,Wang H.A probabilistic model of computing with word[J]. Journel of Computer and System Sciences,2005,70:176-200.
  • 6Mora-Lopez L,Sidrach-de-Cardona M.Using probabilistie finite automata to simulate hourly series of global radiation[J].Solar Energy, 2003,74 : 235-244.
  • 7Dupont P,Denis F,Esposito Y.Links betwenn probabilistic automata and hidden Markov model:Probabilistic distributions,learning model and induction algorithms[J].Pattem Recognition,2005,38:1349- 1371.
  • 8Wu S H,Smolka S A,Stark E W.Composition and behaviors of probabilistic I/O automata[J].Theoretical Computer Science, 1997,176: 1-38.
  • 9Holocombe W M L. Algebraic Automata Theory[M], Cambridge: Cambridge University Press, 1982.
  • 10Oded Maler. A decomposition theorem for probabilistic transition systems[J], Theoretical Computer Science, 1995, 145:391-396.

共引文献3

贵阳学院学报（自然科学版）
2015年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部