Please use this identifier to cite or link to this item:
Title: Application of the principal partition and principal lattice of partitions of a graph to the problem of decomposition of a finite state machine
Authors: ROY, SUBIR
Keywords: Algorithms
Finite Automata
Mathematical Models
Turing Machines
State Assignment
Issue Date: 1993
Publisher: IEEE
Citation: Proceedings of the IEEE International Symposium on Circuits and Systems, Chicago, 3-6 May 1993, 2564-2567
Abstract: 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.
ISBN: 0-7803-1281-3
Appears in Collections:Proceedings papers

Files in This Item:
File Description SizeFormat 
693215.pdf337.17 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.