Several extensions of the Parikh matrix L-morphism

► We construct a Parikh q-matrix L-morphism as in Egecioglu and Ibarra (IFIP 2004) for subwords from any language L. ► We show that padding the Parikh L-matrix by one row and one column allows constructing unambiguous q-matrix morphism. ► We show that fuzzy subword occurrences (e.g., in DNA sequencing) can be counted by a Parikh matrix L-morphism.