Computing ε-free NFA from regular expressions in O(n log2(N)) time-Reference-Cited by-同舟云学术

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

Computing ε-free NFA from regular expressions in O(n log2(N)) time

Published:1998 Issue: Volume: Page:277-285
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 1998
language:
Short-container-title:

Author:

Hagenah Christian,Muscholl Anca

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055777

Reference5 articles.

1. G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoretical Computer Science, 48:117–126, 1986.

2. A. Brüggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120:197–213, 1993.

3. A. Ehrenfeucht and P. Zeiger. Complexity measures for regular expressions. Journal of Computer and System Sciences, 12:134–146, 1976.

4. A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1989.

5. J. Hromkovič, S. Seibert, and T. Wilke. Translating regular expressions into small ε-free nondeterministic finite automata. In Proc. of the 14th Ann. Symp. on Theor. Aspects of Comp. Sci. (STACS'97), no. 1200 in LNCS, p. 55–66, 1997. Springer.

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

1. Efficient testing and matching of deterministic regular expressions;Journal of Computer and System Sciences;2017-11

2. Parameterized regular expressions and their languages;Theoretical Computer Science;2013-02

3. Distributed XML design;Journal of Computer and System Sciences;2011-11

4. Distributed XML design;Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '09;2009

5. PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA;International Journal of Foundations of Computer Science;2007-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3