SCOPUS 정보 검색 플랫폼

Volumn 273, Issue 1-2, 2002, Pages 11-33

A combinatorial problem on Trapezoidal words

Author keywords

Special factors; Sturmian words; Subword complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; SET THEORY;

TRAPEZOIDAL WORDS;

COMBINATORIAL MATHEMATICS;

EID: 0037186210 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(00)00431-X Document Type: Article

Times cited : (15)

References (8)

1
- 0031145891
- Sturmian words, Lyndon words and trees
- (1997) Theoret. Comput. Sci. , vol.178 , pp. 171-203
- Berstel, J.¹ De Luca, A.²

2
- 0031210138
- Sturmian words: Structure, combinatorics, and their arithmetics
- (1997) Theoret. Comput. Sci. , vol.183 , pp. 45-82
- De Luca, A.¹

4
- 0003076564
- On the combinatorics of finite words
- (1999) Theoret. Comput. Sci. , vol.218 , pp. 13-39
- De Luca, A.¹

5
- 0025416849
- Sur les facteurs des suites de Sturm
- (1990) Theoret. Comput. Sci. , vol.71 , pp. 381-400
- Dulucq, S.¹ Gouyou-Beauchamps, D.²

6
- 84966258522
- Uniqueness theorems for periodic functions
- (1965) Proc. Amer. Math. Soc. , vol.3 , Issue.2 , pp. 109-114
- Fine, N.J.¹ Wilf, H.S.²

7
- 0004157169
- Combinatorics on words
- Ed. Gian-Carlo Rota, Addison-Wesley Reading, MA
- (1983) Series Encyclopedia of Mathematics and its Applications , vol.17
- Lothaire¹

8
- 0004073990
- electronic version of the book available on the web-page
- Algebraic Combinatorics on Words
- Lothaire¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.