Abstract

This paper presents algorithms for solving several matching problems on Mazurkiewicz traces. The creation of the algorithms is reduced to the construction of automata that recognize corresponding rational trace languages. Such languages and their properties were studied by many authors. This paper considers trace languages used in solving concrete problems that have analogs in stringology.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call