欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
对幺半环上确定型有限状态自动机及其约简性进行定义，得出两个状态是否可分的判定方法，证明了幺半环上任意一个有限状态自动机都与一个约简的自动机等价，并给出了一个具体可行的算法，最后举例验证了这一结果。
英文摘要：
In this paper,a deterministic finite-state automata over unitary semirings and its reduction are defined,a method to determine whether its two states are distinguishable or not is obtained. For each deterministic finite-state automaton over a unitary semirings,there must exist a reductive finite-state automaton which is equivalent to it. A concrete feasible computing algorithm about the reduction of the type of automata is given. An example is given to illustrate these results.
同期刊论文项目
同项目期刊论文
期刊信息
位置：