On NFA Reductions-Reference-Cited by-同舟云学术

On NFA Reductions

Published:2004 Issue: Volume: Page:112-124
ISSN:0302-9743
Container-title:Theory Is Forever
language:
Short-container-title:

Author:

Ilie Lucian,Navarro Gonzalo,Yu Sheng

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-27812-2_11.pdf

Reference22 articles.

1. Brüggemann-Klein, A.: Regular expressions into finite automata. Theoret. Comput. Sci. 120, 197–213 (1993)

2. Lecture Notes in Computer Science;J.-M. Champarnaud,2003

3. Glushkov, V.M.: The abstract theory of automata. Russian Math. Surveys 16, 1–53 (1961)

4. Hagenah, C., Muscholl, A.: Computing ε -free NFA from regular expressions in O(n log 2(n)) time. Theor. Inform. Appl. 34(4), 257–277 (2000)

5. Hopcroft, J.: An n log n algorithm for minimizing states in a finite automaton. In: Proc. Internat. Sympos. Theory of machines and computations, Technion, Haifa, pp. 189–196. Academic Press, New York (1971)

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

1. Finite Automata synthesis from Interactions;Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE);2024-04-14

2. Mata: A Fast and Simple Finite Automata Library;Lecture Notes in Computer Science;2024

3. Reasoning About Regular Properties: A Comparative Study;Automated Deduction – CADE 29;2023

4. Left is Better Than Right for Reducing Nondeterminism of NFAs;International Journal of Foundations of Computer Science;2021-04-23

5. Simulations in Rank-Based Büchi Automata Complementation;Programming Languages and Systems;2019