Complexity of neural networks on Fibonacci-Cayley tree
This paper investigates the coloring problem on Fibonacci-Cayley tree, which is a Cayley graph whose vertex set is the Fibonacci sequence. More precisely, we elucidate the complexity of shifts of finite type defined on Fibonacci-Cayley tree via an invariant called entropy. We demonstrate that comput...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yildiz Technical University
2019-05-01
|
| Series: | Journal of Algebra Combinatorics Discrete Structures and Applications |
| Online Access: | http://jacodesmath.com/index.php/jacodesmath/article/view/259 |