Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Applying a uniform m ...
Article

Applying a uniform marked morphism to a word

Anna Frid (1)
(1) Novosibirsk State University
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 1999
Last modified on
March 31, 2025
Volume 3
vol. 3:3, Special Issue STACS'98
DOI
10.46298/dmtcs.255
License
https://about.hal.science/hal-authorisation-v1
Indicators
1209
Views
916
Downloads

Applying a uniform marked morphism to a word

Anna Frid (1)
(1) Novosibirsk State University
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • D0L words
  • HD0L words
  • subword complexity
  • functions of a word
Cited by

Source: OpenCitations

  • Latin square Thue-Morse sequences are overlap-free

    Discrete Mathematics & Theoretical Computer Science

    Authors : C. Robinson Tompkins

    Journal reference : Volume Vol. 9 no. 1, 2007, pp.

    DOI : 10.46298/dmtcs.400

  • Palindromic sequences generated from marked morphisms

    European Journal of Combinatorics

    Authors : Sébastien Labbé ORCID, Edita Pelantová ORCID

    Journal reference : Volume 51, 2015, pp. 200-214

    DOI : 10.1016/j.ejc.2015.05.006

  • Characterizations of families of morphisms and words via binomial complexities

    Open Repository and Bibliography (University of Liège)

    Authors : Michel Rigo ORCID, Manon Stipulanti ORCID, Markus A. Whiteland ORCID

    Journal reference : Volume 118, 2024, pp. 103932

    DOI : 10.1016/j.ejc.2024.103932

  • Binomial Complexities and Parikh-Collinear Morphisms

    Open Repository and Bibliography (University of Liège)

    Authors : Michel Rigo ORCID, Manon Stipulanti ORCID, Markus A. Whiteland ORCID

    Journal reference : Volume , 2022, pp. 251-262

    DOI : 10.1007/978-3-031-05578-2_20

  • Synchronizing delay for binary uniform morphisms

    Theoretical Computer Science

    Authors : Karel Klouda ORCID, Kateřina Medková ORCID

    Journal reference : Volume 615, 2015, pp. 12-22

    DOI : 10.1016/j.tcs.2015.11.043
Preview
Loading PDF preview...