PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY

被引：21

作者：

Mahalingam, Kalpana ^{[1
]}

Subramanian, K. G. ^{[2
]}

机构：

[1] Indian Inst Technol, Dept Math, Madras 600036, Tamil Nadu, India

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

来源：

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2012年 / 23卷 / 01期

关键词：

Parikh vector; Parikh matrix; subword; SUBWORD OCCURRENCES; INJECTIVITY;

D O I：

10.1142/S0129054112500049

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The Parikh vector of a word enumerates the symbols of the alphabet that occur in the word. The Parikh matrix of a word which has been recently introduced, is an extension of the notion of Parikh vector and gives more numerical information about the word in terms of certain subwords. Intensive investigation on various theoretical properties of Parikh matrices has taken place. This paper deals with the problem of finding properties of words so that their Parikh matrices commute.

引用

页码：207 / 223

页数：17

共 20 条

[1]

ATANASIU A, 2001, FUND INFORM, V46, P1

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

Atanasiu, Adrian ;

Atanasiu, Radu ;

Petre, Ion .

THEORETICAL COMPUTER SCIENCE, 2008, 390 (01) :102-109

[3] Binary amiable words [J].

Atanasiu, Adrian .

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (02) :387-400

[4] PARIKH MATRIX MAPPING AND LANGUAGES [J].

Atanasiu, Radu-Florian .

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (06) :993-1004

[5]

Fazekas Szilard Zsolt, 2008, Journal of Automata, Languages and Combinatorics, V13, P233

[6] Some characterizations of Parikh matrix equivalent binary words [J].

Fossé, S ;

Richomme, G .

INFORMATION PROCESSING LETTERS, 2004, 92 (02) :77-82

[7] A sharpening of the Parikh mapping [J].

Mateescu, A ;

Salomaa, A ;

Salomaa, K ;

Yu, S .

RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2001, 35 (06) :551-564

[8] Subword histories and Parikh matrices [J].

Mateescu, A ;

Salomaa, A ;

Yu, S .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2004, 68 (01) :1-21

[9] Matrix indicators for subword occurrences and ambiguity [J].

Mateescu, A ;

Salomaa, A .

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (02) :277-292

[10] ON CONTEXT-FREE LANGUAGES [J].

PARIKH, RJ .

JOURNAL OF THE ACM, 1966, 13 (04) :570-+

← 1 2 →