Pattern matching in trace monoids

Extended abstract
  • Jochen Messner
Automata Theory III
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1200)


An algorithm is presented solving the factor problem in trace monoids. Given two traces represented by words, the algorithm determines in linear time whether the first trace is a factor of the second one. The space used for this task is linear in the length of the first word. Similar to the Knuth-Morris-Pratt Algorithm for the factor problem on words, the algorithm simulates a finite automaton determined by the first word on the second word. To develop the algorithm, we examine overlaps of two traces, and extensible trace pairs (which represent still extensible prefixes of a searched factor appearing in some other trace), and show that both structures are lattices.


Linear Time Pattern Match Finite Automaton Factor Problem Congruence Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A. V., Hopcroft, J. E., and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.Google Scholar
  2. 2.
    Birkhof, G. Lattice Theory. Amer. Math. Soc., Providence, RI, 1940.Google Scholar
  3. 3.
    Cartier, P., and Foata, D. Problèmes combinatoires de commutation et réarrangements. Lect. Notes in Math. 85. Springer, 1969.Google Scholar
  4. 4.
    Cori, R., and Métivier, Y. Recognizable subsets of some partially abelian monoids. Theoretical Computer Science, 35:179–189, 1985.CrossRefGoogle Scholar
  5. 5.
    Cori, R., Métivier, Y., and Zielonka, W. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106:159–202, 1993.CrossRefGoogle Scholar
  6. 6.
    Cori, R., and Perrin, D. Automates et commutations partielles. RAIRO Informatique Théorique et Applications, 19:21–32, 1985.Google Scholar
  7. 7.
    Diekert, V. Combinatorics on Traces. LNCS 454. Springer, 1990.Google Scholar
  8. 8.
    Diekert, V., and Métivier, Y. Partial commutation and traces. In Rozenberg, G., and Salomaa, A., Handbook on Formal Languages, volume III. Springer, 1996.Google Scholar
  9. 9.
    Diekert, V., and Rozenberg G., editors. The Book of Traces. World Scientific, Singapore, 1995.Google Scholar
  10. 10.
    Duboc, C. On some equations in free partially commutative monoids. Theoretical Computer Science, 46:159–174, 1986.CrossRefGoogle Scholar
  11. 11.
    Eilenberg, S. Automata, Languages, and Machines, volume A. Academic Press, New York and London, 1974.Google Scholar
  12. 12.
    Gastin, P., and Rozoy, B. The poset of infinitary traces. Theoretical Computer Science, 120:101–121, 1993.CrossRefGoogle Scholar
  13. 13.
    Hashiguchi, K., and Yamada, K. String matching problems over free partially commutative monoids. Information and Computation, 101:131–149, 1992.CrossRefGoogle Scholar
  14. 14.
    Knuth, D. E., Morris, J. H., and Pratt, V. R. Fast pattern matching in strings. SIAM Journal on Computing, 6:323–350, 1977.CrossRefGoogle Scholar
  15. 15.
    Liu, H.-N., Wrathall, C., and Zeger, K. Efficient solution of some problems in free partially commutative monoids. Information and Computation, 89:180–198, 1990.CrossRefGoogle Scholar
  16. 16.
    Mazurkiewicz, A. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, 1977.Google Scholar
  17. 17.
    Otto, F., and Wrathall, C. Overlaps in free partially commutative monoids. Journal of Computer and System Sciences, 42:186–198, 1991.CrossRefGoogle Scholar
  18. 18.
    Reischuk, K. R. Einführung in die Komplexitätstheorie. Teubner, Stuttgart, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Jochen Messner
    • 1
  1. 1.Abt. Theoretische InformatikUniversität UlmUlmGermany

Personalised recommendations