RegularExpressionManipulationFSMModel.pptVIP

Regular Expression ManipulationFSM Model Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 5 Null Machine 3 Methods for Proving That a Machine Accepts No Words By inspection Any path from the start state to a final state means that at least one word is accepted by the machine By state diagram manipulation If a final state is relabeled as a start state, then the machine must accept at least one word Null Machine By converting the regular expression into a deterministic FA If possible, FA must accept at least one word Conversion to FA may no