Abstract
The paper investigates inference based on quantities |W|_u, the number of occurrences of a word u as a scattered subword of W. Parikh matrices recently introduced are useful tools for such investigations. We introduce and study universal languages for Parikh matrices. We also obtain results concerning the inference from numbers |W|_u to W, as well as from certain entries of a Parikh matrix to other entries.
| Original language | English |
|---|---|
| Pages (from-to) | 65-79 |
| Number of pages | 15 |
| Journal | Fundamenta Informaticae |
| Volume | 73 |
| Issue number | 1-2 |
| Publication status | Published - 2006 |
Keywords
- Ambiguity
- Inference from subwords
- Number of subwords
- Parikh matrix
- Scattered subword
- Subword