SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System
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,...
Main Author: | McIntosh, Harold V. |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/6154 |
Similar Items
-
CGRU and CONG: CONVERT and LISP Programs to Find the Congruence Relations of a Finite State Machine
by: McIntosh, Harold V.
Published: (2004) -
A Miscellaney of Convert Programming
by: McIntosh, Harold V., et al.
Published: (2004) -
A Program Feature for CONVERT
by: Guzman, Adolfo, et al.
Published: (2004) -
REEX: A CONVERT Program to Realize the McNaughton-Yamada Analysis Algorithm
by: McIntosh, Harold V.
Published: (2004) -
REC/8: A CONVERT Compiler of REC for the PDP-8
by: McIntosh, Harold V.
Published: (2004)