• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Subword Histories and Parikh Matrices

Alexandru Mateescu, Arto Salomaa, Sheng Yu, Subword Histories and Parikh Matrices. TUCS Technical Reports 442, Turku Centre for Computer Science, 2002.

Abstract:

Parikh matrices recently introduced give much more information about a word
than just the number of occurrences of each letter. In this paper we introduce the
general notion of a subword history and obtain a sequence of results, valid for
arbitrary words. We also investigate overall methods for establishing the validity of
such results. The paper can be viewed as a contribution toward arithmetization of
questions concerning words.

Files:

Full publication in PDF-format

BibTeX entry:

@TECHREPORT{tMaYu02a,
  title = {Subword Histories and Parikh Matrices},
  author = {Mateescu, Alexandru and Salomaa, Arto and Yu, Sheng},
  number = {442},
  series = {TUCS Technical Reports},
  publisher = {Turku Centre for Computer Science},
  year = {2002},
}

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

Edit publication