메뉴 건너뛰기
International Journal of Computer Mathematics
Volumn 82, Issue 10, 2005, Pages 1191-1198
Approximate matching of XML document with regular hedge grammar
Author keywords

Algorithm design; Document transformation; Pattern matching; Tree editing
Indexed keywords

ALGORITHMS; PATTERN MATCHING; TREES (MATHEMATICS);
EID: 31744441062     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160412331336053     Document Type: Article
Times cited : (6)
References (4)
  • 1
    • 0345959841 scopus 로고    scopus 로고
    • Approximate tree pattern matching
    • A. Apostolico and Z. Galil (Eds), Chapter 14 (Oxford: Oxford University Press)
    • Shasha, D., Zhang, K., 1997, Approximate tree pattern matching. In: A. Apostolico and Z. Galil (Eds) Pattern Matching Algorithms, Chapter 14 (Oxford: Oxford University Press).
    • (1997) Pattern Matching Algorithms
    • Shasha, D.1    Zhang, K.2
  • 2
    • 8744271664 scopus 로고
    • Approximately matching context free languages
    • Myers, G., 1995, Approximately matching context free languages. Information Processing Letters, 54, 85-92.
    • (1995) Information Processing Letters , vol.54 , pp. 85-92
    • Myers, G.1
  • 3
    • 0001925731 scopus 로고
    • On recognizable sets and tree automata
    • M. Nivat and H. Ait-Kaci (Eds) (New York: Academic Press)
    • Courcelle, B., 1989, On recognizable sets and tree automata. In: M. Nivat and H. Ait-Kaci (Eds) Resolution of Equations in Algebraic Structures (New York: Academic Press).
    • (1989) Resolution of Equations in Algebraic Structures
    • Courcelle, B.1

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