DFA - Design 2

Number of states to design an automaton that accepts 'abbaab' as a substring is

(a)  

A finite-state automaton is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source state and input symbol, and reading an input symbol is required for each state transition.

• True

• False

Choose the string accepted by the given automata.

• 011

• 1010

• 111

• 0001

The given automata is a non-deterministic automata.

• True

• False

A finite-state automaton is called a deterministic finite automaton (DFA), if each of its transitions is partially determined by its source state and input symbol, and reading an input symbol is required for each state transition.

• True

• False

The given automata accepts odd number of a's.

• True

• False

Choose the string accepted by the given automaton.

• aaaba

• aaaa

• aaab

• baab

The above automata is

• NFA

• DFA

Choose the strings accepted by the given automaton.

• {11,110,111...}

• {01,011,0011...}

• {10,100,1000,...}

• {010,0101,0111..}

Choose the non-deterministic automaton from the list of automata's given below.

• 
• 
• 
•