Please use this identifier to cite or link to this item:
|標題:||Palindrome words and reverse closed languages||作者:||Yu, S.S.
|關鍵字:||palindrome;primitive word;2-code;regular language;prefix code||Project:||International Journal of Computer Mathematics||期刊/報告no：:||International Journal of Computer Mathematics, Volume 75, Issue 4, Page(s) 389-402.||摘要:||
A word which is equal to its mirror image is called a palindrome word. Any language consisting of palindrome words is called a palindrome language. In this paper we investigate properties of palindrome words and languages. We show that there is no dense regular language consisting of palindrome words. A language contains all the mirror images of its elements is called a reverse closed language. Clearly, every palindrome language is reverse closed. We show that whether a given regular or context-free language is reverse closed is decidable. We study certain properties concerning reverse closed finite maximal prefix codes in this paper. Properties of languages that commute with reverse closed languages are investigated too.
|Appears in Collections:||資訊科學與工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.