An efficient recognizer for the Boolean closure of context-free languages-Reference-Cited by-同舟云学术

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

An efficient recognizer for the Boolean closure of context-free languages

Published:1991-03 Issue:1 Volume:80 Page:53-75
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Heilbrunner Stephan,Schmitz Lothar

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference7 articles.

1. An efficient context-free parsing algorithm;Earley;Comm. ACM,1970

2. An improved context-free recognizer;Graham;ACM TOPLAS,1980

3. Introduction to Formal Language Theory;Harrison,1978

4. Regular expressions and state graphs for automata;McNaughton;IRE Trans. Electron. Comput.,1960

5. Formal Languages;Salomaa,1973

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

1. Boolean Kernels of Context-Free Languages;Implementation and Application of Automata;2021

2. A Tale of Conjunctive Grammars;Developments in Language Theory;2018

3. Conjunctive and Boolean grammars: The true general case of the context-free grammars;Computer Science Review;2013-08

4. The Boolean closure of linear context-free languages;Acta Informatica;2008-01-10

5. Bounded fixed-point definability and tabular recognition of languages;Computer Science Logic;1996

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP