Synchronous machines valued in complete lattices and their smallest realization

doi:10.3778/j.issn.1002-8331.2010.18.005

Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (18): 13-14.DOI: 10.3778/j.issn.1002-8331.2010.18.005

• 博士论坛 • Previous Articles Next Articles

Synchronous machines valued in complete lattices and their smallest realization

LI Ping¹，LI Yong-ming^1，2

1.College of Mathematics and Information Science，Shaanxi Normal University，Xi’an 710062，China
2.College of Computer Science，Shaanxi Normal University，Xi’an 710062，China

Received:2009-11-24 Revised:2010-05-10 Online:2010-06-21 Published:2010-06-21
Contact: LI Ping

取值于完备格的同步机及其最小实现化

李平¹，李永明^1，2

1.陕西师范大学数学与信息科学学院，西安 710062
2.陕西师范大学计算机科学学院，西安 710062

通讯作者: 李平

Abstract

Abstract: The concepts of the synchronous machines valued in complete lattices and the accessibility，the observability are introduced.Two basic conclusions are given：The property of finite values and the ordering lemma.And by the two conclusions，the smallest realization of the synchronous machines valued in complete lattices is studied.It shows that the synchronous machine which is accessible and observed is the smallest realization of synchronous machine.

Key words: complete lattices, synchronous machines valued in complete lattice, smallest realization

摘要： 首先给出了取值于完备格的同步机以及它的可达性、可观测性的定义，得到了取值于完备格的同步机的两个基本结论：值有限性及序引理。其次，利用值有限性质及序引理，进一步给出了取值于完备格的同步机的最小实现化问题，并证明了可达且可观测的取值于完备格的同步机就是最小实现化的同步机。

关键词: 完备格, 取值于完备格的同步机, 最小实现化

CLC Number:

TP301.1

LI Ping¹，LI Yong-ming^1，2. Synchronous machines valued in complete lattices and their smallest realization[J]. Computer Engineering and Applications, 2010, 46(18): 13-14.

李平¹，李永明^1，2. 取值于完备格的同步机及其最小实现化[J]. 计算机工程与应用, 2010, 46(18): 13-14.

[1]	SONG Xiaozhen^1，2，HAN Zhaowei¹，LI Yongming³. Algebraic properties of context-free grammar based on quantum logic [J]. Computer Engineering and Applications, 2011, 47(4): 42-46.
[2]	HAN Zhaowei^1，2，HAN Zhaoying³. Algebraic characterizations of context-free languages based on Lukasiewicz logic [J]. Computer Engineering and Applications, 2011, 47(3): 47-50.
[3]	ZHANG Chuang-ye¹，MO Yuan-bin¹，HE Deng-xu¹，WANG Wan-min². AFSA-PSO hybrid algorithm based on chaos-collaborative evolution and its application [J]. Computer Engineering and Applications, 2010, 46(32): 48-51.
[4]	LEI Hong-xuan. Homomorphism and quotient automata of lattice-valued finite states automata [J]. Computer Engineering and Applications, 2010, 46(27): 52-53.
[5]	LEI Hong-xuan^1，2，HUANG Jian-ke³. Constructing algorithms of submachines of lattice-valued finite state machines [J]. Computer Engineering and Applications, 2010, 46(26): 34-35.
[6]	LEI Hong-xuan. Semigroup of lattice-valued finite states automata [J]. Computer Engineering and Applications, 2010, 46(25): 49-50.
[7]	ZONG Rong-fang，LI Feng-lin. Research of steepest descent and conjugate gradient in digital beamforming [J]. Computer Engineering and Applications, 2010, 46(19): 151-153.
[8]	XIE Zheng-wei¹，GUO Zhen². Character of input and output of linear finite automata [J]. Computer Engineering and Applications, 2009, 45(35): 28-30.
[9]	HUANG Fei-dan. Method of minimization of finite recognizer [J]. Computer Engineering and Applications, 2009, 45(27): 28-30.
[10]	LIN Huan-shan，DONG Fu-an，ZHU Lin-hu，QI Li-feng. Sequential particle-probability hypothesis density tracking algorithm [J]. Computer Engineering and Applications, 2009, 45(25): 58-61.
[11]	YANG Zhuo-dong，SHU Lan. Regular fuzzy grammatical inference based on LMBP algorithm of neural network [J]. Computer Engineering and Applications, 2009, 45(25): 65-67.

Synchronous machines valued in complete lattices and their smallest realization

取值于完备格的同步机及其最小实现化

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 11

Recommended Articles

Metrics