- 5
- 0
- 约2万字
- 约 7页
- 2015-11-15 发布于河南
- 举报
《两类模糊有限状态机积的交换性》.pdf
计 算机研究 与发展 DOI:10.7544/issnlOOO一1239.2014
JournalofComputerResearchandDevelopment 5l(9):213O一2l36,2014
两类模糊有限状态机积的交换性
谢正卫 翟 莹。黄飞丹。易 忠 邓培民
(江苏理工学院数理学院 江苏常州 213001)
(广西师范大学数学与统计学院 广西桂林 541004)
。(毕节学院理学 院 贵州毕节 551700)
(桂林航天工业学院理学部 广西桂林 541004)
(weixzh2010@ 163.corn)
OnCommutativityofProductsofTwoTypesFuzzyFiniteStateM achines
XieZhengwei,ZhaiYing。,HuangFeidan。,YiZhong ,andDengPeimin
(SchoolofMathematicsandPhysics.JiangsuUniversityofTechnology,Changzhou,Jiangsu213001)
(SchoolofMathematicsandStatistics,GuangxiNormalUniversity,Guilin,Guangxi541004)
。(CollegeofScience,BijieUniversity,Bijie,Guizhou551700)
(FacultyofScience,GuilinUniversityoJAerospaceTechnology,Guilin,Guangxi541004)
Abstract Automatatheoryisoneofthebasicandimportanttheoriesincomputerscience.Theuseof
algebraictechniquesindeterminingthestructureofautomatahasbeensignificant.Afterword,M alik
eta1.appliedalgebraictechniquesto study fuzzyautomataorfuzzy finitestatemachines(ffsm ).In
thisarticle,thefurtherresearch on thecommutativityoftwotypesffsm isinvestigatedbyalgebraic
toolssuchasmatrices,semgroups,andSOon.Someequivalentcharacterizationsofthecommutativity
offfsm aregiven.Itisprovedthatffsm arecommutativeifandonlyiftheirstatetransitionmatrices
arecommutativeforfuzzymatrixmultiplicationorthesemigroupofstringsoverinputalphabetby
congruencerelationsiscommutative.Thecommutativityofdirectproduct,cascadeproduct,wreath
product,andsum offfsm arediscussed.M eanwhile,theconceptofcommutativityofMealy—typefuzzy
finitestatemachines(M ffsm)isdefined.Thecommutativityofseveralproducts,sum,andquotient
forMffsm are studied in detail.Furthermore,the sufficient and necessary conditions of the
commutativitvof directproduct,sum for ffsm (M ffsm ) are obtained as wellas the sufficient
conditionsofthecommutativityofwreathproduct,cascadeproductforM ffsm.Itisalsoprovedthat
原创力文档

文档评论(0)