Q. The regular languages are not closed under

View solution

Q. The Tuples for NDFA

View solution

Q. NFAs are ___ DFAs.

View solution

Q. An NFA’s transition function returns

View solution

Q. Conversion of a DFA to an NFA

View solution

Q. An NFA may be converted to a DFA using

View solution

Q. The subset construction shows that every NFA accepts a

View solution

Q. Construct a NDFA for the following regular expression

(a∪b)*aba(a∪b)*

View solution

Q. Which is the application of NFA

View solution

Q. Can a DFA simulate NDFA

View solution

Q. Find the wrong statement?

View solution

Q. The behaviour of a NFA can be stimulated by DFA

View solution

Q. The relation between NFA-accepted languages and DFA accepted languages is

View solution

Q. The lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

View solution

Q. What is the complement of the language accepted by the NFA shown below?
(Assume ∑ = {a} and ε is the empty string)

View solution

Q. Which one is a FALSE statement?

View solution

Q. Examine the following DFA: If input is 011100101, which edge is NOT traversed?

View solution

Q. If string s is accepted by this DFA, which of these strings cannot be suffix of s?

View solution

Q. The classes of languages P and NP are closed under certain operations, and not closed under others. Decide whether P and NP are closed under each of the following operations.

1. Union
2. Intersection
3. Intersection with a regular language
4. Kleene closure (star)
5. Homomorphism
6. Inverse homomorphism

View solution

Q. L1 is accepted by the NFA, obtained by changing the accepting state of M to a non-accepting state and vice versa. Which of the following statements is true?

View solution