FCPC - Automata - Midterm Exam

If NFA of 7 states is converted into DFA, maximum possible number of states for the DFA is ?

• 64

• 132

• 128

• 127

In this DFA the accepted Input is

• 01

• 10

• 00

• 11

Consider

the above DFA and suggest the number of state in minimal DFA

• 2

• 3

• 4

• 5

Which of the following is a regular language?

• {aⁱbⁱ|i>=0}

• {aⁱbⁱ|i>=1}

• {aⁱbⁱ|0<i<5}

Which of the following statement is True?

• 1. Every DFA is NFA, but NFA is not DFA

• 1. Every DFA is NFA, also every NFA is DFA

• 1. NFA is faster to process and its representation uses less memory than DFA

• DFA is slower to process and its representation uses less memory than NFA

An NFA’s transition function returns

• A Boolean value

• A state

• An edge

• A set of states

Which is true for Dead State?

• It cannot be reached anytime

• There is no necessity of the state

• If control enters no way to come out from the state

• If control enters FA deads

• {w | w ends with 010}

• {w | w starts with 010}

• {w | w contains 010 as a substring}

• {w | w does not contain 010 as a substring}

ε is used to represent an optional element

Automata have a finite number of states, and the current state determines how the automaton will respond to input.