A Context-Free Grammar Associated with Fibonacci and Lucas Sequences
We introduce a context-free grammar G=s⟶s+d,d⟶s to generate Fibonacci and Lucas sequences. By applying the grammar G, we give a grammatical proof of the Binet formula. Besides, we use the grammar G to provide a unified approach to prove several binomial convolutions about Fibonacci and Lucas numbers...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2023/6497710 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|