SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System

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

Full metadata record

DC Field	Value	Language
dc.creator	McIntosh, Harold V.	-
dc.date	2004-10-04T14:43:30Z	-
dc.date	2004-10-04T14:43:30Z	-
dc.date	1968-01-01	-
dc.date.accessioned	2013-10-09T02:43:31Z	-
dc.date.available	2013-10-09T02:43:31Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-148	-
dc.identifier	http://hdl.handle.net/1721.1/6154	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	SUBM is a CONVERT program, realized in the CTSS LISP of Project MAC, for constructing the subset machine with the same behaviour as a given transition system. The program interactively collects the six items defining a transition system: its state set, alphabet, transition function, initial states, accepting states and spontaneous transitions. It then computes the subset machine, producing its state set, transition function, initial state and accepting states.	-
dc.format	5095531 bytes	-
dc.format	481014 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-148	-
dc.title	SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI