Equations over finite sets of words and equivalence problems in automata theory-Reference-Cited by-同舟云学术

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

Equations over finite sets of words and equivalence problems in automata theory

Published:1993-02 Issue:1 Volume:108 Page:103-118
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Karhumäki J.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference33 articles.

1. Test sets for context-free languages and algebraic systems of equations;Albert;Inform. and Control,1982

2. A proof of Ehrenfeucht's Conjecture;Albert;Theoret. Comput. Sci.,1985

3. Centralizers in free associate algebra;Bergman;Trans. Amer. Math. Soc.,1969

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

5. Theory of Codes;Berstel,1986

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

1. Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines;Automatic Control and Computer Sciences;2021-12

2. On the existence of prime decompositions;Theoretical Computer Science;2007-05

3. The Equivalence Problem of Finite Substitutions on ab*c, with Applications;International Journal of Foundations of Computer Science;2003-08

4. The Equivalence Problem of Finite Substitutions on ab*c, with Applications;Automata, Languages and Programming;2002

5. Undecidability of the equivalence of finite substitutions on regular language;RAIRO - Theoretical Informatics and Applications;1999-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP