TOC UNIT 1

Which of the machine is depends only on the present state of the machine?

• Moore

• Mealy

• DFA

In finite automata, the start state is also called as______state.

• final

• initial

• intermediate

Which of the following state is known as the acceptance state?

• initial

• final

• intermediate

If L1and If L2 are two regular languages then their concatenation L1.L2 will be ________.

• regular

• recursive

• both of the mentioned

Identify a minimum number of DFA states If the language accepting string ending with 01111.

• 4

• 5

• 6

Backtracking is not allowed in _____.

• DFA

• NFA

• both of the mentioned

Which of the following variable is known as an auxiliary variable?

• Nonterminal

• Terminal

• Special

What is the formula for calculating the minimum number of DFA in problem 1?

• n+1

• n+2

• n+3

What is the formula for calculating the minimum number of DFA in problem 2?

• n+1

• n+2

• n+3

In ------, for a particular input symbol, the machine can move to any combination of the states in the machine.

• DFA

• NDFA

• none