Show simple item record

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

dc.date.accessioned2004-10-04T14:43:30Z
dc.date.accessioned2018-11-24T10:12:09Z
dc.date.available2004-10-04T14:43:30Z
dc.date.available2018-11-24T10:12:09Z
dc.date.issued1968-01-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6154
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6154
dc.description.abstractSUBM 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.extent5095531 bytes
dc.format.extent481014 bytes
dc.language.isoen_US
dc.titleSUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition Systemen_US


Files in this item

FilesSizeFormatView
AIM-148.pdf481.0Kbapplication/pdfView/Open
AIM-148.ps5.095Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record