REEX: A CONVERT Program to Realize the McNaughton-Yamada Analysis Algorithm
REEX is a CONVERT program, realized in the CTSS-LISP of Project Mac, for carrying out the McNaughton-Yamada analysis algorithm, whereby a regular expression is found describing the words accepted by a finite state machine whose transition table is given. Unmodified the algorithm will produce 4n term...
Main Author: | McIntosh, Harold V. |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/6159 |
Similar Items
-
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) -
SUBM: A CONVERT Program for Constructing the Subset Machine Defined by a Transition System
by: McIntosh, Harold V.
Published: (2004) -
CGRU and CONG: CONVERT and LISP Programs to Find the Congruence Relations of a Finite State Machine
by: McIntosh, Harold V.
Published: (2004) -
CONVERT
by: Guzman, Adolfo, et al.
Published: (2004)