A New Operator over Parikh Languages

被引：14

作者：

Atanasiu, Adrian ^{[1
]}

Teh, Wen Chean ^{[2
]}

机构：

[1] Univ Bucharest, Fac Math & Comp Sci, Str Acad 14, Bucharest 010014, Romania

[2] Univ Sains Malaysia, Sch Math Sci, George Town 11800, Malaysia

来源：

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2016年 / 27卷 / 06期

关键词：

Parikh matrices; subword; M-equivalence; s-shuffle operator; CORE WORDS; MATRICES; INJECTIVITY;

D O I：

10.1142/S0129054116500271

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The characterization of M-equivalence for the Parikh matrices is a decade old open problem. This paper studies Parikh matrices and M-equivalence in relation to the s-shuffle operator for the binary alphabet. We also study the distance between images under the s-shuffle operator in a graph associated to the corresponding class of M-equivalent words.

引用

页码：757 / 769

页数：13

共 24 条

[1]

Atanasiu A, 2002, FUND INFORM, V49, P289

[2]

Atanasiu A., PAUN65 ANNI IN PRESS

[3] Parikh matrices and amiable words [J].