NEW
Font size
WorksheetsFA conversion
Total questions: 10
Worksheet time: 6mins
State true or false?
Statement: An NFA can be modified to allow transition without input alphabets, along with one or more transitions on input symbols.
True
False
State true or false?
Statement: ε (Input) does not appears on Input tape.
True
False
Statement 1: ε- transition can be called as hidden non-determinism.
Statement 2: δ (q, ε) = p means from q it can jump to p with a shift in read head.
Which among the following options is correct?
Statement 1 and 2, both are correct
Statement 1 and 2, both are wrong
Statement 1 is correct while Statement 2 is wrong
Statement 1 is wrong while Statement 2 is correct
The __________ of a set of states, P, of an NFA is defined as the set of states reachable from any state in P following
e-transitions.
epsilon-closure
closure set
output set
transitions
Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?
Yes
No
Is the number of states in ε-NFA and it's equivalent NFA is same?
Yes
No
Can't be determined
We have constructed M2 by eliminating ε-transitions from M1 , is the number of final states are same in M1 and M2 ?
Yes
No
We can't say
Can we convert ε-NFA to DFA directly?
Yes
No
Initial state of DFA can be determined from its equivalent
ε-NFA by
taking the same initial state
taking the ε-closure of initial state
have to consider all the subsets of states containing initial state
have to consider all the subsets of states containing final state
Final states of DFA can be determined from its equivalent
ε-NFA by
taking the same final states
taking the subset of states containing all the final states
taking the subset of states containing any final state
take all the states as final states
