| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10332906 | Journal of Computer and System Sciences | 2013 | 11 Pages |
Abstract
⺠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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hamed M.K. Alazemi, Anton Äerný,