Algorithms for minimization of finite acyclic automata and pattern matching in terms-Reference-Cited by-同舟云学术

Algorithms for minimization of finite acyclic automata and pattern matching in terms

Published:1991 Issue:3 Volume:27 Page:324-331
ISSN:0011-4235
Container-title:Cybernetics
language:en
Short-container-title:Cybern Syst Anal

Author:

Krivoi S. L.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science,General Computer Science

Link

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

Reference8 articles.

1. V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).

2. J. Hopcroft, ?An n log n algorithm for minimizing states in a finite automaton,? Theory of Machines and Computation, Proc. Int. Symp., Haifa (1971), pp. 189?196.

3. A. A. Letichevskii and A. B. Godlevskii, ?Optimization of algorithms in the process of their design by the method of formalized technical specifications,? in: Computer-Aided Design of Computers and Computer Components [in Russian], IK Akad. Nauk UkrSSR, Kiev (1977), pp. 46?71.

4. A. B. Godlevskii and S. L. Krivoi, ?Transformation synthesis of efficient algorithms using additional specifications,? Kibernetika, No. 6, 37?43 (1986).

5. P. J. Downey, R. Sethy, and R. E. Tarjan, ?Variations on the common subexpression problem,? J. ACM,17, No. 4, 758?771 (1980).

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

1. Minimization of symbolic automata;ACM SIGPLAN Notices;2014-01-13

2. Minimization of symbolic automata;Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages;2014-01-08

3. On the Complexity of Hopcroft’s State Minimization Algorithm;Implementation and Application of Automata;2005