SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System
| dc.contributor.author | McIntosh, Harold V. | en_US |
| dc.date.accessioned | 2004-10-04T14:43:30Z | |
| dc.date.available | 2004-10-04T14:43:30Z | |
| dc.date.issued | 1968-01-01 | en_US |
| dc.identifier.other | AIM-148 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6154 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 5095531 bytes | |
| dc.format.extent | 481014 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | AIM-148 | en_US |
| dc.title | SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System | en_US |
