Syntactic complexity of bifix-free regular languages-Reference-Cited by-同舟云学术

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

Syntactic complexity of bifix-free regular languages

Published:2019-10 Issue: Volume:787 Page:45-76
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Szykuła Marek^ORCID,Wittnebel John

Funder

National Science Centre, Poland

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. Syntactic complexity of ideal and closed languages;Brzozowski,2011

2. Syntactic semigroups;Pin,1997

3. State complexity of regular languages;Yu;J. Autom. Lang. Comb.,2001

4. Quotient complexity of regular languages;Brzozowski;J. Autom. Lang. Comb.,2010

5. J. Myhill, Finite automata and representation of events, Wright Air Development Center Technical Report 57–624.

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

1. The Syntactic Complexity of Semi-flower Languages;Descriptional Complexity of Formal Systems;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP