2019/04/27 by Maurice Margenstern, Margenstern, Maurice
Computer Science · #68R05 #Algorithms and Data Compression #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1904.12135
openalex publication_date 2019/04/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.