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

State complexity of star of union and square of union on k regular languages

  • Published:2013-08 Issue: Volume:499 Page:38-50
  • ISSN:0304-3975
  • Container-title:Theoretical Computer Science
  • language:en
  • Short-container-title:Theoretical Computer Science

Author:

Gao Yuan,Kari Lila

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference31 articles.

1. State complexity of two combined operations: catenation–star and catenation–reversal;Cui;Internat. J. Found. Comput. Sci.,2012

2. State complexity of combined operations with two basic operations;Cui;Theoret. Comput. Sci.,2012

3. State complexity of two combined operations: catenation–union and catenation–intersection;Cui;Internat. J. Found. Comput. Sci.,2011

4. State complexity of basic operations on finite languages;Campeanu,1999

5. Tight lower bound for the state complexity of shuffle of regular languages;Campeanu;J. Autom. Lang. Comb.,2002

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

1. State Complexity of Regular Tree Languages for Tree Matching;International Journal of Foundations of Computer Science;2016-12

2. Operational State Complexity of Subtree-Free Regular Tree Languages;International Journal of Foundations of Computer Science;2016-09

3. State complexity of deletion and bipolar deletion;Acta Informatica;2015-06-16

4. State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages;International Journal of Foundations of Computer Science;2015-02

5. State Complexity of Deletion;Developments in Language Theory;2014
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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