메뉴 건너뛰기




Volumn , Issue , 2000, Pages 63-73

Definability and compression

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; FORMAL LOGIC; MULTIMEDIA SYSTEMS; PATTERN MATCHING;

EID: 0033711814     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/LICS.2000.855756     Document Type: Article
Times cited : (1)

References (12)
  • 1
    • 0004015324 scopus 로고
    • Text Compression
    • Prentice Hall NJ, Englewood Cliffs
    • T. C. Bell J. G. Cleary I. H. Witten Text Compression 1990 Prentice Hall NJ, Englewood Cliffs
    • (1990)
    • Bell, T.C.1    Cleary, J.G.2    Witten, I.H.3
  • 2
    • 84906282784 scopus 로고
    • On a decision method in restricted second order arithmetic
    • J. R. Büchi On a decision method in restricted second order arithmetic Information and the Philosophy of Science 1 Information and the Philosophy of Science 1962
    • (1962) , vol.1
    • Büchi, J.R.1
  • 3
    • 84889281816 scopus 로고
    • Elements of Information Theory
    • John Wiley
    • T. Cover J. Thomas Elements of Information Theory 1991 John Wiley
    • (1991)
    • Cover, T.1    Thomas, J.2
  • 4
    • 33646903575 scopus 로고    scopus 로고
    • Text compression using antidictionaries
    • M. Crochemore F. Mignoni A. Restive S. Salemi Text compression using antidictionaries 26th International Colloquium on Automata, Languages and Programming, ICALP'99 1644 26th International Colloquium on Automata, Languages and Programming, ICALP'99 Prague 1999-July-11-15
    • (1999) , vol.1644
    • Crochemore, M.1    Mignoni, F.2    Restive, A.3    Salemi, S.4
  • 5
    • 0028769318 scopus 로고
    • P-complete problems in data compression
    • S. de Agostino P-complete problems in data compression Theoretical Computer Science 127 181 186 1994
    • (1994) Theoretical Computer Science , vol.127 , pp. 181-186
    • de Agostino, S.1
  • 6
    • 0004231561 scopus 로고
    • Finite Model Theory
    • Springer-Verlag
    • H.-D. Ebbinghaus J. Flum Finite Model Theory 1991 Springer-Verlag
    • (1991)
    • Ebbinghaus, H.-D.1    Flum, J.2
  • 7
    • 84944056157 scopus 로고
    • Decision problems of finite automata design and related arithmetics
    • C. Elgot Decision problems of finite automata design and related arithmetics Transactions of the American Mathematical Society 98 21 52 1961
    • (1961) Transactions of the American Mathematical Society , vol.98 , pp. 21-52
    • Elgot, C.1
  • 8
    • 85177140307 scopus 로고
    • String matching in Lempel-Ziv compressed strings
    • M. Farach String matching in Lempel-Ziv compressed strings ACM Symposium on the Theory of Computing ACM Symposium on the Theory of Computing 1991
    • (1991)
    • Farach, M.1
  • 9
    • 79959939099 scopus 로고
    • Combinatorial Pattern Matching
    • A text compression scheme that allows fast searching directly in the compressed file Springer Verlag Berlin
    • U. Manber Combinatorial Pattern Matching 807 113 124 1994 Springer Verlag Berlin A text compression scheme that allows fast searching directly in the compressed file
    • (1994) , vol.807 , pp. 113-124
    • Manber, U.1
  • 10
    • 0012926802 scopus 로고
    • Elementary computability, formal languages, and automat
    • Prentice-Hall N.J., Englewood Cliffs
    • R. McNaughton Elementary computability, formal languages, and automat 1982 Prentice-Hall N.J., Englewood Cliffs
    • (1982)
    • McNaughton, R.1
  • 11
    • 84957642924 scopus 로고    scopus 로고
    • Pattern matching in text compression by using antidictionaries
    • Y. Shibata M. Takeda A. Shinohara S. Arikawa Pattern matching in text compression by using antidictionaries 10th Annual Symposium on Combinatorial Pattern Matching, CPM'99 1645 10th Annual Symposium on Combinatorial Pattern Matching, CPM'99 Warwick 1999-July-22-24
    • (1999) , vol.1645
    • Shibata, Y.1    Takeda, M.2    Shinohara, A.3    Arikawa, S.4


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