Record Details

Application of the principal partition and principal lattice of partitions of a graph to the problem of decomposition of a finite state machine

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Application of the principal partition and principal lattice of partitions of a graph to the problem of decomposition of a finite state machine
 
Creator ROY, SUBIR
NARAYANAN, H
 
Subject algorithms
finite automata
mathematical models
turing machines
state assignment
 
Description We relate the Principal Partition of a graph G to the
problem of Finite State Machine (FSM) Decomposition
by modelling the FSMaa a Stotc Tkansition Graph
(STG) and using the underlying graph of its STG. We
obtain efficient algorithms to decompose a FSM by
relating the Principal Partition to the more general
notion of the Principal Lattice oj Portitionr of an ap
propriately defined submodular function.
 
Publisher IEEE
 
Date 2009-01-21T06:47:29Z
2011-11-28T07:09:28Z
2011-12-15T09:56:52Z
2009-01-21T06:47:29Z
2011-11-28T07:09:28Z
2011-12-15T09:56:52Z
1993
 
Type Article
 
Identifier Proceedings of the IEEE International Symposium on Circuits and Systems, Chicago, 3-6 May 1993, 2564-2567
0-7803-1281-3
http://hdl.handle.net/10054/569
http://dspace.library.iitb.ac.in/xmlui/handle/10054/569
 
Language en