State Elimination Ordering Strategies: Some Experimental Results
نویسندگان
چکیده
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To overcome this, simple heuristic methods have been proposed. In this paper we analyse some of the heuristics presented in the literature and propose new ones. We also present some experimental comparative results based on uniform random generated deterministic finite automata.
منابع مشابه
Parallel Gaussian Elimination with Linear Work and Fill
This paper presents an algorithm for nding parallel elimination orderings for Gaussian elimination. Viewing a system of equations as a graph, the algorithm can be applied directly to interval graphs and chordal graphs. For general graphs, the algorithm can be used to parallelize the ordering produced by some other heuristic such as minimum degree. In this case, the algorithm is applied to the c...
متن کاملParallel Gaussian Elimination with Linear Work
This paper presents an algorithm for nding parallel elimination orderings for Gaussian elimination. Viewing a system of equations as a graph, the algorithm can be applied directly to interval graphs and chordal graphs. For general graphs, the algorithm can be used to parallelize the ordering produced by some other heuristic such as minimum degree. In this case, the algorithm is applied to the c...
متن کاملSymbolic Factorisation of Sparse Matrix Using Elimination Trees
Many problems in science and engineering require the solving of linear systems of equations. As the problems get larger it becomes increasingly important to exploit the sparsity inherent in many such linear systems. It is well recognized that finding a fill-reducing ordering is crucial to the success of the numerical solution of sparse linear systems. The use of hybrid ordering partitioner is e...
متن کاملPost-Processing Elimination Orderings to Reduce Induced Width
The induced width along an elimination ordering is an important factor in the space and time complexity of many inference algorithms for graphical models. Indeed, slight changes in induced width can sometimes dictate whether a particular problem is feasible (i.e. will t in memory) using variable elimination methods. For this reason, generating low width elimination orders has received extensive...
متن کاملThe effect of cognitive-based cognitive-mindedness-based therapy on emotional schemas and cognitive-emotional ordering strategies of divorced women
Introduction: Divorce as the legal end of a paired relationship is one of the most stressful events in life, and how to manage and adjust emotions is one of the determinants of mental health and quality of life. The aim of this study was to determine the effect of cognitive-mindedness-based therapy on emotional schemas and cognitive-emotional ordering strategies of divorced women. Method: The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010