Name
Abstract | ||
|---|---|---|
This paper reports on a study of some combinatorial properties of overlapping words and overlapping languages. A maximal overlapping subword v of u is an overlapping subword of u and any word of a longer length than the word v is not an overlapping subword of u. For a language L, the notation mo(u) and mo(L) are used to represent the maximal overlapping subword of u and the set {mo(u) | u∈L}, respectively. It is true that mo(fn)=fn-1 for each primitive word f and n≥2. It is also shown that for a language L, whether L is a prefix code can be determined by whether mo(L) is a prefix code, and that if mo(L) is dense it always implies that L is dense. Some results concerning a language L satisfying mo(L)=L are provided. Several characterizations between a word w and its overlapping language 〈 w〉 are presented. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1080/00207160701398029 | Int. J. Comput. Math. |
Keywords | Field | DocType |
overlapping subword,overlapping language,primitive word,maximal overlapping subword v,language l,notation mo,prefix code,maximal overlapping subword,satisfying mo,overlapping word,satisfiability | Discrete mathematics,Notation,Mathematical analysis,Arithmetic,Prefix code,Mathematics | Journal |
Volume | Issue | ISSN |
85 | 2 | 0020-7160 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kuo-Hsiang Chen | 1 | 196 | 29.46 |
| Zheng-Zhu Li | 2 | 11 | 2.63 |
| Yen-Shung Tsai | 3 | 1 | 1.07 |