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: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6154 |
| _version_ | 1811097181761830912 |
|---|---|
| author | McIntosh, Harold V. |
| author_facet | McIntosh, Harold V. |
| author_sort | McIntosh, Harold V. |
| collection | MIT |
| 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. |
| first_indexed | 2024-09-23T16:55:38Z |
| id | mit-1721.1/6154 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T16:55:38Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/61542019-04-12T08:29:26Z SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System McIntosh, Harold V. 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. 2004-10-04T14:43:30Z 2004-10-04T14:43:30Z 1968-01-01 AIM-148 http://hdl.handle.net/1721.1/6154 en_US AIM-148 5095531 bytes 481014 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | McIntosh, Harold V. SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System |
| title | SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System |
| title_full | SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System |
| title_fullStr | SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System |
| title_full_unstemmed | SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System |
| title_short | SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System |
| title_sort | subm a convert program for constructing the subset machine defined by a transition system |
| url | http://hdl.handle.net/1721.1/6154 |
| work_keys_str_mv | AT mcintoshharoldv submaconvertprogramforconstructingthesubsetmachinedefinedbyatransitionsystem |