First   |   Last   |   Prev   |   Next

In step 3, we consider all unmarked pairs one by one. Considering the unmarked pair , we find that & go to and , respectively, on input 0. we use the notation to indicate this. SInce the pair is not marked, cannot be marked at this point. Again, we see that, and is unmarked. Hence, we cannot mark and since we have considered all input symbols (0 & 1) we need to examine other unmarked pairs. The observations and actions are shown below.

• 
• , cannot mark since & are unmarked .
• 
• , cannot mark since is unmarked .
• , is marked since is already marked.
• , is marked since is already marked.
• , is never marked since it is not in the table & hence is not marked.
• 

First   |   Last   |   Prev   |   Next