Abstract

The two string-matching problems over free partially commutative monoids are studied and analyzed in detail in order to present efficient linear-time algorithms for solving these two problems over a constant-size alphabet.

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