An introduction to parallel algorithms
An introduction to parallel algorithms
Fast text searching: allowing errors
Communications of the ACM
SIAM Journal on Computing
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
FA Minimisation Heuristics for a Class of Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Rewriting Regular Inequalities (Extended Abstract)
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Theoretical study and implementation of the canonical automaton
Fundamenta Informaticae
An efficient incremental DFA minimization algorithm
Natural Language Engineering
Theoretical Computer Science
On size reduction techniques for multitape automata
Theoretical Computer Science - Implementation and application of automata
Minimizing nfa's and regular expressions
Journal of Computer and System Sciences
A family of NFAS free of state reductions
Journal of Automata, Languages and Combinatorics
On the size of the universal automaton of a regular language
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Reducing nondeterministic finite automata with SAT solvers
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Reducing the size of NFAs by using equivalences and preorders
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Size reduction of multitape automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Factorization of fuzzy automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
GPP-Grep: high-speed regular expression processing engine on general purpose processors
RAID'12 Proceedings of the 15th international conference on Research in Attacks, Intrusions, and Defenses
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
| Hi-index | 0.00 |
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of states, related to the inclusion of left and right languages. Since their exact computation is NP-hard, we focus on polynomial approximations which enable a reduction of the NFA all the same. Our main algorithm relies on a first approximation, which can be easily implemented by means of matrix products with an O(mn3) time complexity, and optimized to an O(mn) time complexity, where m is the number of transitions and n is the number of states. This first algorithm appears to be more efficient than the known techniques based on equivalence relations as described by Lucian Ilie and Sheng Yu. Afterwards, we briefly describe some more accurate approximations and the exact (but exponential) calculation of these preorders by means of determinization.