摘要
文中给定整数n>1,对任意整数定义了自动机C n,i,确定了自动机的簇{C n,i|0≤i<n}中的同步自动机及它们的最短同步字。此外,根据自动机的转移损耗函数和字的权重平均损耗函数,分析了该类同步自动机在一些经典应用中的优势。
Let n be an integer greater than 1.After introducing the automaton C n,i for each integer i<n,the synchronizing ones in the family{C n,i|0≤i≤n}of automata as well as their shortest synchronizing words are determined.Moreover,in aids of the so called transition consumption functions of automata and the weighted average consumptions of words,the advantages of such synchronizing automata in some typical applications are analyzed.
作者
陈雪萍
何勇
肖芬芳
CHEN Xue-ping;HE Yong;XIAO Fen-fang(School of Computer Science and Engineering,Hunan University of Science and Technology,Xiangtan,Hunan 411201,China)
出处
《计算机科学》
CSCD
北大核心
2019年第S11期535-538,共4页
Computer Science
基金
国家自然科学基金(61572013)
湖南省科技计划项目(2013FJ4047)
湖南省研究生科研创新基金(CX2017B637)资助
关键词
同步自动机
自动机
Cni
最短同步字
转移损耗函数
权重平均损耗
Synchronizing automaton
Automaton C n
i
Shortest synchronizing word
Transition consumption function
Weighted average consumption
