Where academic tradition
meets the exciting future

On Some Problems of Mateescu Concerning Subword Occurrences

Cunsheng Ding, Arto Salomaa, On Some Problems of Mateescu Concerning Subword Occurrences. TUCS Technical Reports 701, Turku Centre for Computer Science, 2005.

Abstract:

The paper investigates inference based on quantities $\sca{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 $\sca{u}$ to $w$, as well as from
certain entries of a Parikh matrix to other entries.

Files:

Full publication in PDF-format

BibTeX entry:

@TECHREPORT{tDiSa05a,
  title = {On Some Problems of Mateescu Concerning Subword Occurrences},
  author = {Ding, Cunsheng and Salomaa, Arto},
  number = {701},
  series = {TUCS Technical Reports},
  publisher = {Turku Centre for Computer Science},
  year = {2005},
  keywords = {subword, scattered subword, number of subwords, Parikh matrix, inference from subwords, ambiguity},
  ISBN = {952-12-1585-2},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication