A Context-Free Grammar Associated with Fibonacci and Lucas Sequences

被引：0
|
作者：
Yang, Harold Ruilong [1 ]
机构：
[1] Tianjin Univ Technol & Educ, Sch Sci, Tianjin 300222, Peoples R China
来源：
JOURNAL OF MATHEMATICS | 2023年 / 2023卷
基金：
中国国家自然科学基金; 美国国家科学基金会;
关键词：
D O I：
10.1155/2023/6497710
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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, which were given by Hoggatt, Carlitz, and Church. Meanwhile, we also obtain some new binomial convolutions.
引用
收藏
页数：9
相关论文
共 50 条
  • [31] Generalization errors in estimation of stochastic context-free grammar
    Yamazaki, K
    Watanabe, S
    PROCEEDINGS OF THE NINTH IASTED INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, 2005, : 183 - 188
  • [32] Simplification of context-free grammar through Petri net
    Khan, AA
    AlAali, M
    AlShamlan, N
    COMPUTERS & STRUCTURES, 1996, 60 (05) : 849 - 852
  • [33] A novel context-free grammar for the generation of PSO algorithms
    Miranda, Pericles B. C.
    Prudencio, Ricardo B. C.
    NATURAL COMPUTING, 2020, 19 (03) : 495 - 513
  • [34] A context-free grammar for the Ramanujan-Shor polynomials
    Chen, William Y.C.
    Yang, Harold R.L.
    Advances in Applied Mathematics, 2021, 126
  • [35] STOCHASTIC CONTEXT-FREE GRAMMAR AND MARKOV CHAIN.
    Ozeki, Kazuhiko
    Systems - Computers - Controls, 1974, 5 (03): : 104 - 110
  • [36] A context-free grammar for peaks and double descents of permutations
    Fu, Amy M.
    ADVANCES IN APPLIED MATHEMATICS, 2018, 100 : 179 - 196
  • [37] Inference approach for Chinese probabilistic context-free grammar
    You Qi Chu Yun, 6 (385-392):
  • [38] Accurate Context-Free Parsing with Combinatory Categorial Grammar
    Fowler, Timothy A. D.
    Penn, Gerald
    ACL 2010: 48TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 2010, : 335 - 344
  • [39] On the computational power of context-free PC grammar systems
    Mandache, N
    THEORETICAL COMPUTER SCIENCE, 2000, 237 (1-2) : 135 - 148
  • [40] EFFICIENT CONTEXT-FREE GRAMMAR INTRUSION DETECTION SYSTEM
    Gowrison, G.
    Ramar, K.
    Muneeswaran, K.
    Revathi, T.
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2011, 7 (08): : 4779 - 4788
12345