Weighted Moore MachineCongruences and Minimization

LI Suni1,LI Tianchao2,LI Yongming1,3

doi:10.3969/j.issn.1007130X.2010.

Computer Engineering & Science >

2010 , Vol. 32 >Issue 9: 165 - 168

DOI: https://doi.org/10.3969/j.issn.1007130X.2010.

论文

Weighted Moore MachineCongruences and Minimization

Expand

(1.School of Mathematics and Information Science,Shaanxi Normal University,Xi’an 710062;2.Network Information Center,Shaanxi Normal University,Xi’an 710062;3.School of Computer Science,Shaanxi Normal University,Xi’an 710062,China)

Received date: 2010-03-11

Revised date: 2010-06-19

Online published: 2010-09-02

Fold

Abstract

The congruences and homomorphisms of a weighted Moore machine are defined in this paper. Moreover, a homomorphism theorem is given and the congruence relations form a complete lattice in the weighted Moore machine are proved. Under the congruence relation,the factor Moore machine of the weighted Moore machine is given. The algorithm of finding the minimum state Moore machine is presented.

Key words： weighted Moore machine;congruences;algorithm

Cite this article

LI Suni1,LI Tianchao2,LI Yongming1,3 . Weighted Moore MachineCongruences and Minimization[J]. Computer Engineering & Science, 2010 , 32(9) : 165 -168 . DOI: 10.3969/j.issn.1007130X.2010.

Options

Outlines

模态框（Modal）标题

Abstract

Cite this article