Name
Abstract | ||
|---|---|---|
Parikh matrices as an extension of Parikh vectors are useful tools in arithmetizing words by numbers. This paper presents a further study of Parikh matrices by restricting the corresponding words to terms formed over a signature. Some M-equivalence preserving rewriting rules for such terms are introduced. A characterization of terms that are only M-equivalent to themselves is studied for binary signatures. Graphs associated to the equivalence classes of M-equivalent terms are studied with respect to graph distance. Finally, the preservation of M-equivalence under the term self-shuffle operator is studied. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1142/S0129054120500306 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | DocType | Volume |
Parikh matrices, terms, M-equivalence, distance, self-shuffle operator | Journal | 31 |
Issue | ISSN | Citations |
5 | 0129-0541 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zi Jing Chern | 1 | 0 | 0.34 |
| K. G. Subramanian | 2 | 339 | 59.27 |
| Azhana Ahmad | 3 | 0 | 0.34 |
| Wen Chean Teh | 4 | 30 | 9.64 |