Lecture12-1_Part30

Lecture12-1_Part30 - an already marked state. 4. If no...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Consider T= “On a DFA input < A > : 1. Mark the start state of A . 2. Repeat until no new states are marked: 3. Mark any state that has an incoming transition from
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: an already marked state. 4. If no accept state is marked -accept . Otherwise reject . Proof 30...
View Full Document

Ask a homework question - tutors are online