Dissertation > Excellent graduate degree dissertation topics show

A Research on the Commutative Properties of Languages

Author: WangJiong
Tutor: WangZhiXi
School: Hunan University of Science and Technology
Course: Computer Science and Technology
Keywords: Centralizer Codes Commutative Properties Languages Maximal Codes Primitive Roots Unambiguous Product
CLC: O152.1
Type: Master's thesis
Year: 2011
Downloads: 8
Quote: 0
Read: Download Dissertation

Abstract


Let A be an alphabet. The language X ,Y (?) A* are called commutative if XY = YX, called partially commutative if XY (?) YX or YX ? XY. It is a well-known result that if x , y∈A+ ,xy = yx then there exist t∈A+ , m, n> 0 such that x = t m ,y = tn. If we replace the x ,y by commutative languages, the conditions are turning to be complicated.In this article, we first researched the properties of commutation or partially commutation with codes. In the aspect of the relation between commutative properties of codes and unambiguous sets, the result that if a code commutates with a certain language then their product is unambiguous is given. In the aspect of the relation between commutative properties of codes and maximal codes, the result that any code X ? A+ partially commutated by A* is a maximal code is proven. Obviously, any code X commutated by A* is a maximal code. Let X ? A+ be a code, the result are also given that X commutated by A* if and only if X = An,n is a positive integer. In the later 1980s, B. Ratoandromanana had proposed a conjecture that any code has a unique primitive root. An equivalent character of the conjecture is given; it gives a new way to resolve the conjecture.In this article, we also researched the properties of commutation with general languages. We emphatically analyzed the 1-free largest language commutated with a certain language, i.e. the centralizer of the language. We proven that there is a boundary of those finitely generated centralizers, i.e. there exists a positive integer n such that any language with elements less than or equal n has a finitely generated centralizer, and that for any positive integer m larger than n there must be a m -elements language hasn’t a finitely generated centralizer. For researching the boundary problem, the utility of binary singular languages is developed. Some special cases about the finitely generated centralizer of 4 elements languages are given by using the theory mentioned above.

Related Dissertations

  1. Investigation and Countermeasures of Junior High School Students’ Written Language at Rural Schools in Dongguan City,G633.3
  2. Design of the Comparison between Domestic and International Road Alignment Study,U412.3
  3. A Comparative Study of the Paddy Cultivation Vocabulary between Debao Zhuang and Chiangmai Thai,H218
  4. Research and FPGA Design of an Improved PS-LDPC Codes,TN791
  5. Empirsche Untersuchung Zum Motivationswandel Des Studiumbegleitenden Deutschlernens,H33
  6. Research on the Channel Influence and Antijamming Methods of Wireless OCDMA Systems,TN929.533
  7. Finite ring Z_ (p ~ 2) (p ≠ 2) cyclic code re root of negative studies,O157.4
  8. Turbo Codes Based on Chaotic Mapping DRP interleaver design and related performance analysis,TN911.22
  9. GSM-R in the electrified catenary line noise environment analysis of error control and interrupt,U225
  10. Endangered Bonan villages language,H234
  11. Research on the Language Status under Globalization,H0
  12. Research on General Encoding Algorithms for LDPC Codes and FPGA Implementation,TN911.2
  13. Coded Modulation with Low Density Parity Check Code,TN911.2
  14. Middle school language textbook study classical notes,G633.3
  15. Research and Implementation of Digtial Image Encryption Algorithm Based on Turbo Code,TN918.82
  16. Research on Decoding Algorithm for LDPC Codes,TN911.22
  17. The Research of Atmospheric Laser Communication in RS Concatenated Code,TN929.13
  18. Research on Puncture Algorithm for Rate-Compatible Low-Density Parity-Check Codes and Its Applicitions,TN911.22
  19. Serially concatenated encoding and decoding Design and FPGA Implementation,TN911.22
  20. Design on Satellite Transmission Link in Airborne Real-Time Information Collection System,TN927.2

CLC: > Mathematical sciences and chemical > Mathematics > Algebra,number theory, portfolio theory > Group theory > Finite group theory
© 2012 www.DissertationTopic.Net  Mobile