摘要
在由字母表 {u ,v}所生成的自由单式半群上定义了两类特殊的Fibonacci语言Fu ,v={u ,v ,uv ,vuv,… }和F0u ,v={u ,v,vu ,vuv,… } ,其中u ,v是两个定义在一个有限的字母表X上的非空字 .在这篇文章中 ,作者探讨了F1u ,v和F0u ,v中的具有相同的长度的字是一对共轭对 .当u ,v不是X+ 上同一个字母的方幂时 ,F1u ,v\{ {u ,v ,uv ,vuv}是一个本原字集 .一个非空的语言L是一个密码 ,若x1,x2 ,… ,xn,y1,y2 ,… ,ym ∈L ,x1,x2 …xn=y1,y2 …ym 成立就意味着n =m和xi=yi,i=1 ,2 ,… ,n .当k 2时 ,语言Fk={ωnk\{u ,v,uv,vuv|n 1 }是一个密码 ,其中ωnk指的是第nk
On the unitary hemi group built on the alphabet {u,v}, two kinds of Fibonacci languages F1 u.v ={u,v,uv,vuv,...} and F0 u.v ={u,v,vu,vuv,...} are defined, therein u,v are two non null words defined on a finite alphabet X. In this article, the author demonstrates the words of same length in F1 u.v and F0 u.v are conjugated pairs. When u,v is not the power of the same letter in X+, F1 u.v\{{u,v,uv,vuv} is an original character set. A non null language L is a code, and if x1,x2,...,xn, y1,y2,...ym ∈L, x1,x2...xn=y1,y2...ym tenable it is true that n = m and xi = yi, i=1,2,...,n. When k≥2, Fk = {ωnk \{u,v,uv,vuv| n≥1} is a code, thereintoωnk is the nk th Fibonacci word.
出处
《洛阳师范学院学报》
2001年第5期5-8,共4页
Journal of Luoyang Normal University
