![]() ![]() State transaction diagram of machine ‘M’: NFAs state diagram State transaction table of machine ‘M’: Present StateĪs we know that NFAs and DFAs are equivalent, so if a language is recognized by an NFA then it is also recognized by a DFA and vice versa. ![]() The language of NFA consist a set of all strings chosen from ∑ * that all are accepted by machine M.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |