![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
This paper extends the understanding of involution palindrome words (θ-palindrome words). This notion is motivated by the DNA strand design in the area of biocomputing where the Watson–Crick complementarity can be abstracted as an antimorphic involution function. A language consisting of involution palindrome words is defined as an involution palindrome language. Some properties of involution palindrome words and languages are surveyed in this paper. Besides involution palindrome words being considered, some algebraic properties of skew involution palindrome words are studied as well. Furthermore, we exhibit certain characteristics of non-involution palindrome words.
2000 AMS Subject Classification :
Acknowledgements
The authors would like to thank the referees for their careful reading of the manuscript and useful suggestions.