CAT Question

Complement of DFA that accept those strings where after each ‘ a , always ‘ b ‘ appears ,is the DFA that accept those string where after ‘ a ‘ never ‘ b ‘ appears
2) In a language – no. of state in minimal NFA is n, then in worst case , maximum no. of state in equivalent DFA is 2n .
3) Minimal DFA always contains only one dead state?

This discussion on Complement of DFA that accept those strings where after each ‘ a , always ‘ b ‘ appears ,is the DFA that accept those string where after ‘ a ‘ never ‘ b ‘ appears2) In a language – no. of state in minimal NFA is n, then in worst case , maximum no. of state in equivalent DFA is 2n .3) Minimal DFA always contains only one dead state? is done on EduRev Study Group by CAT Students. The Questions and Answers of Complement of DFA that accept those strings where after each ‘ a , always ‘ b ‘ appears ,is the DFA that accept those string where after ‘ a ‘ never ‘ b ‘ appears2) In a language – no. of state in minimal NFA is n, then in worst case , maximum no. of state in equivalent DFA is 2n .3) Minimal DFA always contains only one dead state? are solved by group of students and teacher of CAT, which is also the largest student community of CAT. If the answer is not available please wait for a while and a community member will probably answer this soon. You can study other questions, MCQs, videos and tests for CAT on EduRev and even discuss your questions like Complement of DFA that accept those strings where after each ‘ a , always ‘ b ‘ appears ,is the DFA that accept those string where after ‘ a ‘ never ‘ b ‘ appears2) In a language – no. of state in minimal NFA is n, then in worst case , maximum no. of state in equivalent DFA is 2n .3) Minimal DFA always contains only one dead state? over here on EduRev! Apart from being the largest CAT community, EduRev has the largest solved Question bank for CAT.
Do you know? How Toppers prepare for CAT Exam
With help of the best CAT teachers & toppers, We have prepared a guide for student who are preparing for CAT : 15 Steps to clear CAT Exam

Download free EduRev App

Track your progress, build streaks, highlight & save important lessons and more!
This discussion on Complement of DFA that accept those strings where after each ‘ a , always ‘ b ‘ appears ,is the DFA that accept those string where after ‘ a ‘ never ‘ b ‘ appears2) In a language – no. of state in minimal NFA is n, then in worst case , maximum no. of state in equivalent DFA is 2n .3) Minimal DFA always contains only one dead state? is done on EduRev Study Group by CAT Students. The Questions and Answers of Complement of DFA that accept those strings where after each ‘ a , always ‘ b ‘ appears ,is the DFA that accept those string where after ‘ a ‘ never ‘ b ‘ appears2) In a language – no. of state in minimal NFA is n, then in worst case , maximum no. of state in equivalent DFA is 2n .3) Minimal DFA always contains only one dead state? are solved by group of students and teacher of CAT, which is also the largest student community of CAT. If the answer is not available please wait for a while and a community member will probably answer this soon. You can study other questions, MCQs, videos and tests for CAT on EduRev and even discuss your questions like Complement of DFA that accept those strings where after each ‘ a , always ‘ b ‘ appears ,is the DFA that accept those string where after ‘ a ‘ never ‘ b ‘ appears2) In a language – no. of state in minimal NFA is n, then in worst case , maximum no. of state in equivalent DFA is 2n .3) Minimal DFA always contains only one dead state? over here on EduRev! Apart from being the largest CAT community, EduRev has the largest solved Question bank for CAT.