Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Subword Occurrences, Weighted ...

Subword Occurrences, Weighted Automata and Iterated Morphisms, Especially the Fibonacci Morphism

Arto Salomaa, Subword Occurrences, Weighted Automata and Iterated Morphisms, Especially the Fibonacci Morphism. Theoretical Computer Science 432, 85–93, 2012.

Abstract:

The paper investigates the number of subword occurrences in a word, in particular, in a word obtained by iterating a morphism. Associated graphs or automata are used as a tool. Special attention is paid to the Fibonacci morphism. Explicit formulas in terms of n are obtained for the number of occurrences of subwords of length at most 2 in the nth iteration of the Fibonacci morphism.

BibTeX entry:

@ARTICLE{jSalomaa_Arto12a,
  title = {Subword Occurrences, Weighted Automata and Iterated Morphisms, Especially the Fibonacci Morphism},
  author = {Salomaa, Arto},
  journal = {Theoretical Computer Science},
  volume = {432},
  pages = {85–93},
  year = {2012},
  keywords = {Subword, Number of subwords, Iterated morphism, Fibonacci morphism, Fibonacci word},
}

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

Publication Forum rating of this publication: level 2

Edit publication