Hyper-Minimization in O(n 2)-Reference-Cited by-同舟云学术

Hyper-Minimization in O(n 2)

Published: Issue: Volume: Page:223-231
ISSN:0302-9743
Container-title:Implementation and Applications of Automata
language:
Short-container-title:

Author:

Badr Andrew

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70844-5_23.pdf

Reference8 articles.

1. Badr, A., Geffert, V., Shipman, I.C.: Hyper-minimizing minimized deterministic finite state automata. RAIRO - Theoretical Informatics and Applications (to appear), http://www.rairo-ita.org/articles/ita/abs/first/ita07033/ita07033.html

2. Câmpeanu, C., Santean, N., Yu, S.: Minimal cover-automata for finite languages. In: Workshop on Implementing Automata, pp. 43–56 (1998)

3. Körner, H.: A time and space efficient algorithm for minimizing cover automata for finite languages. International Journal of Foundations of Computer Science 14(2), 1071–1086 (2003)

4. Câmpeanu, C., Paun, A., Smith, J.R.: Incremental construction of minimal deterministic finite cover automata. Theor. Comput. Sci. 363(2), 135–148 (2006)

5. Sipser, M.: Introduction to the Theory of Computation. International Thomson Publishing (1996)

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

1. The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities;Electronic Proceedings in Theoretical Computer Science;2016-09-13

2. Hyper-Minimization for Deterministic Weighted Tree Automata;Electronic Proceedings in Theoretical Computer Science;2014-05-21

3. Better Hyper-minimization;Implementation and Application of Automata;2011

4. An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton;Theoretical Computer Science;2010-08

5. An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton;Implementation and Application of Automata;2009