About Fibonacci trees. I
Formal Languages and Automata Theory
2019-04-30 v1 Discrete Mathematics
Abstract
In this first paper, we look at the following question: are the properties of the Fibonacci tree still true if we consider a finitely generated tree by the same rules but rooted at a black node? The direct answer is no, but new properties arise, a bit more complex than in the case of a tree rooted at a white node, but still of interest.
Cite
@article{arxiv.1904.12135,
title = {About Fibonacci trees. I},
author = {Maurice Margenstern},
journal= {arXiv preprint arXiv:1904.12135},
year = {2019}
}
Comments
17 pages, 9 figures