Saved Bookmarks
| 1. |
Question No. 4• Let the class of languageaccepted by finite state machine be L1and the class of languagesrepresented by regular expressionsbe L2 thenAnswerA. L1=L2C. L1 U L2 = .*D. L1=L2SkipSave & NextPrevious1 |
|
Answer» By the |
|