Please use this identifier to cite or link to this item:
|Title:||The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function|
|Publisher:||ELSEVIER SCIENCE BV|
|Citation:||DISCRETE APPLIED MATHEMATICS, 131(2), 299-310|
|Abstract:||In this paper, some problems that arise in the realization of finite state machines (FSM) are shown to be strongly related to the theory of submodular functions. Specifically, we use the idea of the principal lattice of partitions of a submodular function to develop approximation algorithms for minimizing the "cost" of realization of an FSM through a decomposition strategy. (C) 2003|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.