Graph connectivity, partial words, and a theorem of Fine and Wilf-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Graph connectivity, partial words, and a theorem of Fine and Wilf

Published:2008-05 Issue:5 Volume:206 Page:676-693
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Blanchet-Sadri F.,Bal Deepak,Sisodia Gautam

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference36 articles.

1. Uniqueness theorems for periodic functions;Fine;Proc. Am. Math. Soc.,1965

2. Fine and Wilf’s theorem for three periods and a generalization of Sturmian words;Castelli;Theor. Comput. Sci.,1999

3. Generalised Fine and Wilf’s theorem for arbitrary number of periods;Constantinescu;Theor. Comput. Sci.,2005

4. On a paper by Castelli, Mignosi, Restivo;Justin;Theor. Inform. Appl.,2000

5. Fine and Wilf words for any periods;Tijdeman;Indagat. Math.,2003

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A periodicity lemma for partial words;Information and Computation;2020-12

2. String periods in the order-preserving model;Information and Computation;2020-02

3. String Periods in the Order-Preserving Model;LEIBNIZ INT PR INFOR;2018

4. How Much Different Are Two Words with Different Shortest Periods;IFIP Advances in Information and Communication Technology;2018

5. On Periodicity Lemma for Partial Words;Language and Automata Theory and Applications;2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP