On the state complexity of operations on two-way finite automata-Reference-Cited by-同舟云学术

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

On the state complexity of operations on two-way finite automata

Published:2017-04 Issue: Volume:253 Page:36-63
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Jirásková Galina,Okhotin Alexander

Funder

VEGA

Slovak Research and Development Agency

Academy of Finland

Publisher

Elsevier BV

Subject

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

Reference30 articles.

1. Partial orders on words, minimal elements of regular languages, and state complexity;Birget;Theor. Comput. Sci.,1993

2. State-complexity of finite-state devices, state compressibility and incompressibility;Birget;Math. Syst. Theory,1993

3. Finite automata and unary languages;Chrobak;Theor. Comput. Sci.,1986

4. State complexity of power;Domaratzki;Theor. Comput. Sci.,2009

5. An alternating hierarchy for finite automata;Geffert;Theor. Comput. Sci.,2012

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

1. Performing Regular Operations with 1-Limited Automata;Theory of Computing Systems;2024-03-14

2. Homomorphisms and inverse homomorphisms on graph-walking automata;Theoretical Computer Science;2023-11

3. Sweeping Permutation Automata;Electronic Proceedings in Theoretical Computer Science;2023-09-15

4. Operational Complexity: NFA-to-DFA Trade-Off;Descriptional Complexity of Formal Systems;2023

5. Homomorphisms on Graph-Walking Automata;Implementation and Application of Automata;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP