adplus-dvertising
frame-decoration

Question

Design a NFA for the language:
L: {an| n is even or divisible by 3}

Which of the following methods can be used to simulate the same.

a.

e-NFA

b.

Power Construction Method

c.

both a and b

d.

None of the mentioned

Answer: (c).both a and b

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Design a NFA for the language: L: {an| n is even or divisible by 3} Which of the following methods can be used to simulate the same.

Similar Questions

Discover Related MCQs

Q. Which of the following not an example Bounded Information?

Q. A Language for which no DFA exist is a________

Q. A DFA cannot be represented in the following format

Q. When are 2 finite states equivalent?

Q. Can a DFA recognize a palindrome number?

Q. Which of the following is not an example of finite state machine system?

Q. The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________

Q. Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be represented as:

Q. For a machine to surpass all the letters of alphabet excluding vowels, how many number of states in DFA would be required?

Q. 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?

Q. Given:
L= {xϵ∑= {0,1} |x=0n1n for n>=1}; Can there be a DFA possible for the language?

Q. How many languages are over the alphabet R?

Q. According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}
Statement 1: q ϵ Q’;
Statement 2: FϵQ

Q. δˆ tells us the best:

Q. Which of the following option is correct?
A= {{abc, aaba}. {ε, a, bb}}

Q. For a DFA accepting binary numbers whose decimal equivalent is divisible by 4, what are all the possible remainders?

Q. Given:
L1= {xϵ ∑*|x contains even no’s of 0’s}

L2= {xϵ ∑*|x contains odd no’s of 1’s}

Nunber of final states in Language L1 U L2?

Q. The maximum number of transition which can be performed over a state in a DFA?
∑= {a, b, c}

Q. The maximum sum of in degree and out degree over a state in a DFA can be determined as:
∑= {a, b, c, d}

Q. The sum of minimum and maximum number of final states for a DFA n states is equal to: