An algorithm to minimize representations of finite order relations
Camino R. Vela, Antonio Bahamonde · International Journal of Computer Mathematics · 1992
In this paper we present an algorithm to minimize the number of nodes in a finite graph that represents an order relation. The idea is to set the representing problem in the minimal realization of nondeterministic automata framework [3, 9]. Thus, starting from a deterministic draft we improve the representation by means of the scoop minimization [2, 6, 9] in order to get rid of unuseful nodes/states.