Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Fibonacci Words"”.

  1. DNA Computing: Modelling in Formal Languages and Combinatorics on Words, and Complexity Estimation

    … by studying formal language and combinatorics on words concepts motivated by DNA processes. It also contributes to the experimental research in DNA computing by a scaling comparison between DNA computing and other models of computation. First, for theoretical DNA computing research, we propose a …

    waterloo Repository record for DNA Computing: Modelling in Formal Languages and Combinatorics on Words, and Complexity Estimation (opens in a new tab)

  2. Characteristics and regularities of graphs and words

    … involving stars, stripes and tress).<br/><br/>Words, also called strings, are also structures that have acquired great importance in recent years mainly due to their use in DNA modelling. We show some new results regarding the identification and appearance of seeds in strings (a linear time …

    kings Repository record for Characteristics and regularities of graphs and words (opens in a new tab) Download PDF for Characteristics and regularities of graphs and words (opens in a new tab)

  3. EFFICIENT COMPUTATION OF CLOSED SUBSTRINGS

    … ($\mathsf{LCP}$) array of $ w[1..n] $. Given a Fibonacci word $f_n$, where $n>5$, the thesis shows that the exact number of MCSs is $ M(f_n) \approx \left(1 + \frac{1}{\phi^2}\right) F_n \approx 1.382 F_n $, where $ \phi $ is the golden ratio, and $ F_n $ is the $ n $-th Fibonacci number. These …

    mcmaster Repository record for EFFICIENT COMPUTATION OF CLOSED SUBSTRINGS (opens in a new tab)