Discrete Mathematics & Theoretical Computer Science, DMTCS Special Issue: STACS'98

Font Size:  Small  Medium  Large
DMTCS vol 3 no 3 (1999), pp. 125-140

Discrete Mathematics & Theoretical Computer Science


Volume 3 n° 3 (1999), pp. 125-140

author:Anna Frid
title:Applying a uniform marked morphism to a word
keywords:D0L words, HD0L words, subword complexity, functions of a word
abstract:We describe the relationship between different parameters of the initial word and its image obtained by application of a uniform marked morphism. The functions described include the subword complexity, frequency of factors, and the recurrence function. The relations obtained for the image of a word can be used also for the image of a factorial language. Using induction, we give a full description of the involved functions of the fixed point of the morphism considered.
reference: Anna Frid (1999), Applying a uniform marked morphism to a word, Discrete Mathematics and Theoretical Computer Science 3, pp. 125-140
ps.gz-source:dm030304.ps.gz (54 K)
ps-source:dm030304.ps (146 K)
pdf-source:dm030304.pdf (269 K)

The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Automatically produced on Sat Nov 13 19:15:39 CET 1999 by novelli