On some problems of Mateescu concerning subword occurrences

被引：0
|
作者：
Ding, Cunsheng
Salomaa, Arto
机构：
[1] Turku Ctr Comp Sci, FIN-20520 Turku, Finland
[2] Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
来源：
FUNDAMENTA INFORMATICAE | 2006年 / 73卷 / 1-2期
关键词：
subword; scattered subword; number of subwords; Parikh matrix; inference from subwords; ambiguity;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：65 / 79
页数：15
相关论文
共 50 条
12345