1 Crore+ students have signed up on EduRev. Have you? Download the App 
Under which of the following operation, NFA is not closed?
It is less complex to prove the closure properties over regular languages using
Which of the following is an application of Finite Automaton?
John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ in it. How many number of transitions would John use such that, the string processing application works?
Which of the following do we use to form an NFA from a regular expression?
Which among the following can be an example of application of finite state machine(FSM)?
Which among the following is not an application of FSM?
L1= {w  w does not contain the string tr }
L2= {w  w does contain the string tr}
Given ∑= {t, r}, The difference of the minimum number of states required to form L1 and L2?
Predict the number of transitions required to automate the following language using only 3 states:L= {w  w ends with 00}
The total number of states to build the given language using DFA:L= {w  w has exactly 2 a’s and at least 2 b’s}
18 videos56 docs44 tests

18 videos56 docs44 tests
