어떤 정규언어와 Prefix CodingSome Regular Languages and Prefix Coding
- Other Titles
- Some Regular Languages and Prefix Coding
- Authors
- 나현숙; Mordecai Golin
- Issue Date
- Feb-2005
- Publisher
- 한국통신학회
- Citation
- 한국통신학회지, v.30, no.2, pp.1 - 9
- Journal Title
- 한국통신학회지
- Volume
- 30
- Number
- 2
- Start Page
- 1
- End Page
- 9
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/39549
- ISSN
- 1226-4717
- Abstract
- Code is a set of words. If, for any pair of words in the code, one is not prefix of another, the code is called “Prefix(-Free) Code”. The prefix coding problem is, given n, to find an optimal code with the minimum-sum of lengths of n words. As a special case of this, we present a method to find, given language L in some specific classes of regular languages, an optimal code among prefix codes in L. We also show how the structure of optimal codes varies as n grows, using trees.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.