Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction-Reference-Cited by-同舟云学术

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

Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction

Published:1987 Issue: Volume: Page:121-132
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Benois M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-17220-3_11.pdf

Reference14 articles.

1. M. Benois: Parties rationnelles du groupe libre, C.R.Acad.Sci.Paris ser. A269, 1969, 1188–1190.

2. M.Benois et P.Butzbach: Langages algébriques déterministes et transversale rationnelle, Rapport de recherche n o 446, L.S.D. IMAG 1984.

3. M.Benois et J.Sakarovitch: On the complexity of some extended word problems defined by cancellation rules, Information Processing Letters à paraître.

4. J.Berstel: Transductions and context free languages. Teubner 1979.

5. R. Book, M. Jantzen and C. Wrathall, Monadic Thue Systems, Theoret. Comput. Sci. 19 (1982) 231–251.

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

1. Pointlike Sets and Separation: A Personal Perspective;Developments in Language Theory;2021

2. On the semigroup rank of a group;Semigroup Forum;2018-11-09

3. Fixed points of endomorphisms over special confluent rewriting systems;Monatshefte für Mathematik;2009-06-06

4. Bottom-Up Rewriting Is Inverse Recognizability Preserving;Lecture Notes in Computer Science

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP