Cybernetics and Systems Analysis

, Volume 46, Issue 4, pp 546–553 | Cite as

Inclusion problems in trace monoids



Efficient pattern matching algorithms for traces and their dependence graphs are proposed. Pattern matching problems related to problems of recognizing frequent patterns in structured data and counting the number of trace object windows that include a pattern are considered.


pattern matching monoid of traces dependence graph 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Y. Chi, H. Wang, P. S. Yu, and R. R. Muntz, “Catch the moment: Maintaining closed frequent itemsets over a date stream sliding window,” Knowledge and Inform. Systems, 10, No. 3, 265–294 (2006).CrossRefGoogle Scholar
  2. 2.
    H-F. Li, M-K. Shan, S-Y. Lee, “DSM-FI: An efficient algorithm for mining frequent itemsets in data streams,” Knowledge and Inform. Systems, 17, No. 1 (2008).Google Scholar
  3. 3.
    C. Ba, M. H. Ferrari, and M. A. Musicante, “Composing Web Services with PEWS: A trace-theoretical approach,” in: 4th Europ. Conf. on WEB Services (2006).Google Scholar
  4. 4.
    H. Mannila, H. Toivonen, and A. Verkamo, “Discovering frequent episodes in sequences,” in: Proc. KDD Conf. (1955).Google Scholar
  5. 5.
    A. Avellone and M. Goldwurm, “Analysis of algorithms for the recognition of rational and context-free trace languages,” Theoretical Inform. and Appl., 32, 141–152 (1998).MathSciNetGoogle Scholar
  6. 6.
    Y. Chi, R. Muntz, S. Nijssen, and J. Kok, “Frequent subtree mining: An overview,” Fundamenta Inform., 21, 161–198 (2001).MathSciNetGoogle Scholar
  7. 7.
    M. Crochemore and L. Ilie, “Maximal repetitions in strings,” J. of Comput. and System. Sci., 74, 796–807 (2008).MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    L. Boasson, P. Cegielski, I. Guessarian, and Y. Matiyasevich, “Window-accumulated subsequence problem is linear,” Annals of Pure and Appl. Logic, 113, 74–87 (2001).MathSciNetGoogle Scholar
  9. 9.
    P. Cegielski, I. Guessarian, and Y. Matiyasevich, “Tree inclusion problems,” RAIRO-Theoretical Inform. and Appl., 42, 5–20 (2008).MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    I. Guessarian and P. Cegielski, “Tree inclusions in windows and slices,” in: CSIT Conf. (2000).Google Scholar
  11. 11.
    J. Messner, “Pattern matching in trace monoids,” Symposium on Theoretical Aspects of Comput. Sci. (1997).Google Scholar
  12. 12.
    V. Dikert and G. Rozenberg, The Book of Traces: Handbook of Formal Languages, Springer, N.Y. (1997).Google Scholar
  13. 13.
    A. A. Letichevsky, “On the equivalence of automata over a semigroup,” Teoret. Kibernetika, 6, 3–71 (1970).Google Scholar
  14. 14.
    K. V. Shakhbazyan and Yu. H. Shoukourian, “On process languages in finite graphs,” J. of Mathemat. Sci., 101, No. 4, 205–215 (2000).Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2010

Authors and Affiliations

  1. 1.Institute for Informatics and Automation ProblemsNational Academy of Science of the Republic of ArmeniaYerevanArmenia

Personalised recommendations