Extending Parikh matrices

We introduce the notion of Parikh matrix induced by a word, a natural extension to the notion of Parikh matrix and prove a set of properties for this kind of matrices. We also study the relation between these two notions. We show that combining properties from both we obtain a more powerful tool for...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 310; no. 1; pp. 233 - 246
Main Author SERBANUTA, Traian-Florin
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 2004
Elsevier
Subjects
Exact sciences and technology
Group theory
Group theory and generalizations
Logic and foundations
Mathematical logic, foundations, set theory
Mathematics
Number of subwords
Parikh matrices
Recursion theory
Scattered subword
Sciences and techniques of general use
Subword
Word
Scattered subword
Subword
Word
Parikh matrices
Number of subwords
Extension
Relation
Matrix algebra
Morphism
Monoid
Properties
Parikh matrix
Online AccessGet full text

Cover

More Information
Summary:We introduce the notion of Parikh matrix induced by a word, a natural extension to the notion of Parikh matrix and prove a set of properties for this kind of matrices. We also study the relation between these two notions. We show that combining properties from both we obtain a more powerful tool for proving algebraic properties of words.
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(03)00396-7