1 Crore+ students have signed up on EduRev. Have you? Download the App 
The password to the admins account=”administrator”. The total number of states required to make a passwordpass system using DFA would be __________
Which of the following is the corresponding Language to the given DFA?
Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be represented as:
Let the given DFA consist of x states. Find xy such that y is the number of states on minimization of DFA?
For a machine to surpass all the letters of alphabet excluding vowels, how many number of states in DFA would be required?
6. For the DFA given below compute the following:
Union of all possible combinations at state 7,8 and 9.
Given L= {Xϵ∑*= {a, b} x has equal number of a, s and b’s}.
Which of the following property satisfy the regularity of the given language?
Given:
L= {xϵ∑= {0,1} x=0n1n for n>=1}; Can there be a DFA possible for the language?
The password to the admins account=”administrator”. The total number of states required to make a passwordpass system using DFA would be __________
18 videos56 docs44 tests

18 videos56 docs44 tests
