Elsevier

Discrete Applied Mathematics

Volume 131, Issue 2, 12 September 2003, Pages 299-310
Discrete Applied Mathematics

The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function

https://doi.org/10.1016/S0166-218X(02)00457-2Get rights and content
Under an Elsevier user license
open archive

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.

Keywords

FSM decomposition
Partitions
Submodular functions

Cited by (0)

This research is supported by DST grant no. DS 098/029.