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

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6156

Full metadata record

DC Field	Value	Language
dc.creator	McIntosh, Harold V.	-
dc.date	2004-10-04T14:43:33Z	-
dc.date	2004-10-04T14:43:33Z	-
dc.date	1968-01-01	-
dc.date.accessioned	2013-10-09T02:43:34Z	-
dc.date.available	2013-10-09T02:43:34Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-150	-
dc.identifier	http://hdl.handle.net/1721.1/6156	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	CRGU 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.	-
dc.format	7126875 bytes	-
dc.format	764322 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-150	-
dc.title	CGRU and CONG: CONVERT and LISP Programs to Find the Congruence Relations of a Finite State Machine	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI