FLAT - UNIT 1

Which of the strings does the following DFA accept?

• 10100

• 00110

• 00111

• 01011

Let Σ={a,b,c,d}., How many strings are there in Σ4?

• 256

• 16

• 4

• 64

Identify the Reachable states for the input string 110.

• a,c

• a,b,c

• a

• c

Identify the Reachable states for the input string 0111

• q0

• q1

• q2

• q3

Find e-Closure for the state q0

• {q0,q1,q2}

• {q0,q1,q2,q3,q4}

• {q0,q1}

• {q1,q2,q3,q4}

What is the language accepted by the following finite automata

• Contains Substring 101

• Start with 10

• end with 01

• None of the above

What is the relation between NFA-accepted languages and DFA accepted languages?

• Always greater

• Always lessor

• Equal

• None of the above

Identify the name of method used to convert NFA to DFA

• Thomson Construction

• Ardens Construction

• Subset Construction method

• All of the mentioned

Which of the following does not belong to input alphabet {a,b}*

• Epsilon

• a

• b

• None of the above

Discover the languages accepted by the following automata

• Strings start with zero

• Strings end with zero

• Strings contains any number of zeros , ones and end with zero