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 条
  • [21] CONTROL SETS ON CONTEXT-FREE GRAMMAR FORMS
    GREIBACH, SA
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1977, 15 (01) : 35 - 98
  • [22] Unsupervised Statistical Learning of Context-free Grammar
    Unold, Olgierd
    Gabor, Mateusz
    Wieczorek, Wojciech
    ICAART: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2020, : 431 - 438
  • [23] DESCRIPTIONAL COMPLEXITY OF CONTEXT-FREE GRAMMAR FORMS
    CSUHAJVARJU, E
    KELEMENOVA, A
    THEORETICAL COMPUTER SCIENCE, 1993, 112 (02) : 277 - 289
  • [24] ELIMINATION OF LEFT RECURSION IN CONTEXT-FREE GRAMMAR
    BORDIER, J
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 145 - 162
  • [25] ELIMINATION OF LOEFT RECURSIVITY IN A CONTEXT-FREE GRAMMAR
    BORDIER, J
    REVUE FRANCAISE D INFORMATIQUE DE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 145 - &
  • [26] The omphalos context-free grammar learning competition
    Starkie, B
    Coste, F
    van Zaanen, M
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 16 - 27
  • [27] Statistical Parsing with Context-Free Filtering Grammar
    Demko, Michael
    Penn, Gerald
    ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5549 : 52 - +
  • [28] PERIODIC FIBONACCI AND LUCAS SEQUENCES
    LEWIN, M
    FIBONACCI QUARTERLY, 1991, 29 (04): : 310 - 315
  • [29] Computing a context-free grammar-generating series
    Litow, B
    INFORMATION AND COMPUTATION, 2001, 169 (02) : 174 - 185
  • [30] Simplification of context-free grammar through petri net
    Khan, AA
    AlAali, M
    AlShamlan, N
    COMPUTERS & STRUCTURES, 1996, 58 (05) : 1055 - 1058
12345