Show simple item record

CGRU and CONG: CONVERT and LISP Programs to Find the Congruence Relations of a Finite State Machine

dc.date.accessioned2004-10-04T14:43:33Z
dc.date.accessioned2018-11-24T10:12:10Z
dc.date.available2004-10-04T14:43:33Z
dc.date.available2018-11-24T10:12:10Z
dc.date.issued1968-01-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6156
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6156
dc.description.abstractCRGU is a CONVERT program, CONG its literal transcription into LISP, realized in the CTSS LISP of Project MAC, for finding all the congruence relations of a finite state machine whose transition table is given as an argument. Central to both programs is the hull construction, which forms the smallest congruence relation containing a given relation. This is done by examining all pairs of equivalent elements to see if their images are equivalent. Otherwise the image classes are joined and the calculation repeated. With the hull program, one starts with the identity relation and proceed by joining pairs of congruence classes in previously found partitions, and forming the hull in order to see if he may produce a new partition. The process terminates when all such extensions have been tried without producing any new relations.en_US
dc.format.extent7126875 bytes
dc.format.extent764322 bytes
dc.language.isoen_US
dc.titleCGRU and CONG: CONVERT and LISP Programs to Find the Congruence Relations of a Finite State Machineen_US


Files in this item

FilesSizeFormatView
AIM-150.pdf764.3Kbapplication/pdfView/Open
AIM-150.ps7.126Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record