Because 6 % 5 = 1 this means to add one rule δ:(q 3, 0)→q 1. With this new rule, transition diagram becomes as follows:īelow in each step I pick next subsequent binary number to add a missing edge until I get TD as a 'complete DFA'. And the rule should be present to process strings like '101'.īecause '101' = 5 is divisible by 5, and to accept '101' I will add δ:(q 2, 1)→q 0 in above figure-2. TD already processes prefix string '10' and we just need to add a new transition rule δ:(q 2, 0)→q 4Ībove transition diagram in figure-2 is still incomplete and there are many missing edges, for an example no transition is defined for δ:(q 2, 1)- ?.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |