Descriptional complexity of limited automata-Reference-Cited by-同舟云学术

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

Descriptional complexity of limited automata

Published:2018-04 Issue: Volume:259 Page:259-276
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Kutrib Martin,Pighizzini Giovanni,Wendlandt Matthias

Publisher

Elsevier BV

Subject

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

Reference30 articles.

1. Automata on a 2-dimensional tape;Blum,1967

2. Descriptional Complexity Measures of Regular Languages;Ellul,2004

3. Converting two-way nondeterministic unary automata into simpler automata;Geffert;Theor. Comput. Sci.,2003

4. Computational complexity of one-tape Turing machine computations;Hartmanis;J. ACM,1968

5. One-tape, off-line Turing machine computations;Hennie;Inf. Control,1965

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

1. Between SC and LOGDCFL: families of languages accepted by logarithmic-space deterministic auxiliary depth-k storage automata;International Journal of Computer Mathematics: Computer Systems Theory;2023-01-02

2. Hot Current Topics of Descriptional Complexity;IFIP Advances in Information and Communication Technology;2021

3. Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata;International Journal of Foundations of Computer Science;2020-12

4. Linear-time limited automata;Theoretical Computer Science;2019-12

5. Limited automata and unary languages;Information and Computation;2019-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP