메뉴 건너뛰기




Volumn 178, Issue 1-2, 1997, Pages 205-224

Standard Sturmian morphisms

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING;

EID: 0031146272     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00054-0     Document Type: Article
Times cited : (18)

References (13)
  • 1
    • 0031145891 scopus 로고    scopus 로고
    • Sturmian words, Lyndon words and trees
    • J. Berstel and A. de Luca, Sturmian words, Lyndon words and trees, Theoret. Comput. Sci. 178 (this Vol.) (1997) 171-203.
    • (1997) Theoret. Comput. Sci. , vol.178 , pp. 171-203
    • Berstel, J.1    De Luca, A.2
  • 2
    • 85009879376 scopus 로고
    • A characterization of Sturmian morphisms
    • Springer, Berlin
    • J. Berstel and P. Séébold, A characterization of Sturmian morphisms, Lecture Notes in Computer Science Vol. 711 (Springer, Berlin, 1993) 281-290.
    • (1993) Lecture Notes in Computer Science , vol.711 , pp. 281-290
    • Berstel, J.1    Séébold, P.2
  • 6
    • 0002539856 scopus 로고
    • Descriptions of the characteristic sequence of an irrational
    • T.C. Brown, Descriptions of the characteristic sequence of an irrational, Canad. Math. Bull. 36 (1993) 15-21.
    • (1993) Canad. Math. Bull. , vol.36 , pp. 15-21
    • Brown, T.C.1
  • 8
    • 0347641284 scopus 로고    scopus 로고
    • Sturmian words: Structure, combinatorics, and their arithmetics
    • Preprint 94/16, Dipartimento di Matematica, Università di Roma "La Sapienza", (G. Rozenberg and A. Salomaa, eds.), to appear
    • A. de Luca, Sturmian words: structure, combinatorics, and their arithmetics, Preprint 94/16, Dipartimento di Matematica, Università di Roma "La Sapienza", Theoret. Comput. Sci. special issue on Formal Languages (G. Rozenberg and A. Salomaa, eds.), to appear.
    • Theoret. Comput. Sci. Special Issue on Formal Languages
    • De Luca, A.1
  • 9
    • 0028740618 scopus 로고
    • Some combinatorial properties of Sturmian words
    • A. de Luca and F. Mignosi, Some combinatorial properties of Sturmian words, Theoret. Compul. Sci. 136 (1994) 361-385.
    • (1994) Theoret. Compul. Sci. , vol.136 , pp. 361-385
    • De Luca, A.1    Mignosi, F.2
  • 11
    • 0024681828 scopus 로고
    • Infinite words with linear subword complexity
    • F. Mignosi, Infinite words with linear subword complexity, Theoret. Comput. Sci. 65 (1989) 221-242.
    • (1989) Theoret. Comput. Sci. , vol.65 , pp. 221-242
    • Mignosi, F.1
  • 13
    • 85034450507 scopus 로고
    • Mots infinis en arithmétique
    • M. Nivat and D. Perrin, eds., Automata in Infinite words, Springer, Berlin
    • G. Rauzy, Mots infinis en arithmétique, in: M. Nivat and D. Perrin, eds., Automata in Infinite words, Lecture Notes in Computer Science, Vol. 192 (Springer, Berlin, 1984) 164-171.
    • (1984) Lecture Notes in Computer Science , vol.192 , pp. 164-171
    • Rauzy, G.1


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