The emptiness problem for valence automata over graph monoids-Reference-Cited by-同舟云学术

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

The emptiness problem for valence automata over graph monoids

Published:2021-04 Issue: Volume:277 Page:104583
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Zetzsche Georg

Funder

Deutscher Akademischer Austauschdienst

Labex

Publisher

Elsevier BV

Subject

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

Reference23 articles.

1. Characterizations of the decidability of some problems for regular trace languages;Aalbersberg;Math. Syst. Theory,1989

2. Approximating Petri net reachability along context-free traces;Atig,2011

3. Transductions and Context-Free Languages;Berstel,1979

4. Semilinearity and context-freeness of languages accepted by valence automata;Buckheister,2013

5. The Book of Traces,1995

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

1. Verifying Unboundedness via Amalgamation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. The Complexity of Bidirected Reachability in Valence Systems;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02

3. Recent Advances on Reachability Problems for Valence Systems (Invited Talk);Lecture Notes in Computer Science;2021

4. On the group memory complexity of extended finite automata over groups;Journal of Logical and Algebraic Methods in Programming;2020-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP