期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

准严格关系与码

Quasi- strict relations and codes
原文传递
导出
摘要 定义并确定了自由幺半群上的准严格关系,讨论了所有准严格关系的集合及其若干子集的序性质,并证明了余相容准严格关系的无关语言都是码. The concept that quasi -strict relation on free monoids was introduced,a characterization for quasi -strict relations was given,the ordering properties of the set of all quasi -strict relations as well as some subsets of it were exhibited.Moreover,it is proved that the independent languages of co-compatible quasi-strict relations are codes.
作者 唐美霞 刘宇 何勇
机构地区 南宁职业技术学院信息工程学院 湖南科技大学计算机科学与工程学院
出处 《湖南科技大学学报（自然科学版）》 CAS 北大核心 2015年第2期93-98,共6页 Journal of Hunan University of Science And Technology：Natural Science Edition
基金 湖南省科技计划项目(2013FJ4047)
关键词 码 无关集 准严格关系 余相容关系 code independent set quasi -strict relation co -compatible relation
分类号 TP301.1 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献16

  • 1Berstel J, Pen-in D. Theory of codes[M]. New York: Academic Press, 1985.
  • 2Shyr H J. Free monoids and languages[M]. Taichung: Hon Min Book Company, 2001.
  • 3Yu S S. Languages and codes [M]. Taichung: Tsang Hai Book Publishing Company, 2005.
  • 4Birkhoff G. Lattice theory[M]. New York: American Mathematics Society Colloqume Publication, 1967.
  • 5Tang M X, Wang Z X, He Y. A note on prefix codes[J]. Southeast Asian Bulletin of Mathematics, 2012, 36:715 -720.
  • 6Wang Z X, Liang F X, He Y. Semiring structures of some classes of hypercodes [J]. Journal of Automata, Languages and Combinatorics, 2009, 14 : 259 - 272.
  • 7Shyr H J, Thierrin G. Codes and binary relations[J]. Lecture Notes on Mathematics, 1977, 586:180 -188.
  • 8JUrgensen H, Yu S S. Relations on free monoids, their independent sets and codes [J]. International Journal of Computer Mathematics, 1991,40:17 - 46.
  • 9Hsiao H K, Yeh Y T, Yu S S. Dependences related to strict binary relations [J]. Theoretical Computer Science, 2005, 347 : 306 - 324.
  • 10Lam N H. Maximal independent sets in certain subword orders[J]. Semigroup Forum, 1999, 31.

二级参考文献13

  • 1Shrivastava Y,Dasgupta S, Reddy S M. Guaranteed convergence in a class of Hopfield networks. IEEE Transactions on Neural Networks, 1992, 3(6): 951～961
  • 2Bondy J A, Murty U S R. Graph Theory with Applications. London: The Macmillan Press, 1976
  • 3Mazumadar P, Yih J S. Neural computing for built inself repair of embedded memory arrays. In: Proceedings of the 19th International Symposium on Fault Tolerant Computing, Chicago, USA, 1989. 480～487
  • 4Pramanick I. Parallel dynamic interaciton--An inherently parallel problem solving methodology[Ph D dissertation]. Department of ECE, University of Iowa, Iowa, USA, 1991
  • 5Wilf H S. The number of maximal independent sets in a tree. SIAM Journal of Algebraic Discrete Methods, 1986, 7(1): 125～130
  • 6Jou M J. The number of maximal independent sets in graphs[Master dissertation]. Department of Applied Mathematics, National Chiao Tung Center University, Taiwan, 1990
  • 7Jou M J. Counting independent sets[Ph D dissertation]. Department of Applied Mathematics, National Chiao Tung Center University, Taiwan, 1996
  • 8Jou M J,Chang G J. Maximal independent sets in graphs with at most one circle. Discrete Applied Mathematics, 1997, 79(1～3): 67～73
  • 9Liu J. Maximal and maximum independent sets in graphs[Ph D dissertation]. Department of Mathematics and Statistics, Western Michigan University, West Michigan Avenue, Kalama-200 MI, 1992
  • 10F redi Z. The number of Maximal independent sets in connected graphs. Journal of Graph Theory, 1987, 11(4): 463～470

共引文献8

湖南科技大学学报（自然科学版）
2015年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部