A Context-Free Grammar Associated with Fibonacci and Lucas Sequences

Author:

Yang Harold Ruilong1ORCID

Affiliation:

1. School of Science, Tianjin University of Technology and Education, Tianjin 300222, China

Abstract

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.

Funder

National Natural Science Foundation of China

Publisher

Hindawi Limited

Subject

General Mathematics

Reference9 articles.

1. Some special Fibonacci and Lucas generating functions;V. E. Hoggatt;Fibonacci Quarterly,1971

2. Some classes of Fibonacci sums;L. Carlitz;Fibonacci Quarterly,1978

3. Exponential generating functions for Fibonacci identities;C. A. Church;Fibonacci Quarterly,1973

4. Context-free grammars, differential operators and formal power series;W. Y. C. Chen;Theoretical Computer Science,1993

5. Context-free grammars, permutations and increasing trees;W. Y. C. Chen;Advances in Applied Mathematics,2017

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3