메뉴 건너뛰기




Volumn 787 LNCS, Issue , 1994, Pages 130-141

Generalizations of the periodicity theorem of Fine and Wilf

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; GRAPH THEORY; PATTERN MATCHING;

EID: 85010951233     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017478     Document Type: Conference Paper
Times cited : (19)

References (13)
  • 1
    • 0003160094 scopus 로고
    • Algorithms for Finding Pattern in Strings
    • J. van Leeuwen editor, Elsevier Science Publishers B.V
    • Aho A. V.: Algorithms for Finding Pattern in Strings. In Handbook of Theoretical Computer Science, J. van Leeuwen editor, Elsevier Science Publishers B.V. 1990, 257295
    • (1990) In Handbook of Theoretical Computer Science , pp. 257-295
    • Aho, A.V.1
  • 3
    • 0026992709 scopus 로고
    • Alphabet Independent Two-Dimensional Pattern Matching. Proc. 24th ACM Symp
    • Amir, A., Benson, G. E.: Alphabet Independent Two-Dimensional Pattern Matching. Proc. 24th ACM Symp. Theory on Comp. (1992) 59-68
    • (1992) Theory on Comp , pp. 59-68
    • Amir, A.1    Benson, G.E.2
  • 4
    • 84966258522 scopus 로고
    • Uniqueness Theorem for Periodic Functions
    • Fine, N. J., Wilf, H. S.: Uniqueness Theorem for Periodic Functions. Proc. Am. Math. Soc. 16 (1965) 109-114
    • (1965) Proc. Am. Math. Soc , vol.16 , pp. 109-114
    • Fine, N.J.1    Wilf, H.S.2
  • 5
    • 0026368175 scopus 로고    scopus 로고
    • On the Exact Complexity of String Matching: Upper Bounds
    • Galil, Z., Gian carlo, R.: On the Exact Complexity of String Matching: Upper Bounds. SIAM J. Comp. 20 number 6 1008-1020
    • SIAM J. Comp , vol.20 , Issue.6 , pp. 1008-1020
    • Galil, Z.1    Gian Carlo, R.2
  • 11
    • 85010972593 scopus 로고
    • Towards 2D Pattern Matching Complexity
    • Nicodeme, P., Regnier, M.: Towards 2D Pattern Matching Complexity, manuscript (1992)
    • (1992) Manuscript
    • Nicodeme, P.1    Regnier, M.2


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