Teh, W.C. and Kwa, K.H. (2015) Core words and Parikh matrices. Theoretical Computer Science, 582. pp. 60-69. ISSN 0304-3975, DOI https://doi.org/10.1016/j.tcs.2015.03.037.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.tcs.2015.03.037
Abstract
Parikh matrices have been widely investigated due to their applicability in arithmetizing words by numbers. This paper introduces the core of a binary word, which captures the essential part of a word from the perspective of its Parikh matrix. Additionally, the stronger notion of core M-unambiguity is introduced and the characterization of core M-unambiguous binary words is obtained. Finally, a generalization of the core of a binary word and some of its interesting properties are investigated.
| Item Type: | Article |
|---|---|
| Funders: | Short term grant No. 304/PMATHS/6313077 of Universiti Sains Malaysia |
| Uncontrolled Keywords: | Parikh matrix; Subword; Ambiguity; Core of a word |
| Subjects: | Q Science > Q Science (General) Q Science > QA Mathematics |
| Divisions: | Faculty of Science > Institute of Mathematical Sciences |
| Depositing User: | Ms. Juhaida Abd Rahim |
| Date Deposited: | 03 Oct 2018 07:29 |
| Last Modified: | 03 Oct 2018 07:29 |
| URI: | http://eprints.um.edu.my/id/eprint/19573 |
Actions (login required)
 |
View Item |
