CS402 Quiz 3

Q1. state is not important in Melay machine.

1. Combination of
2. Initial
3. Final
4. Empty

Correct answer: Final

Q2. Two machines are said to be equivalent if they print the _____ output string when the _____input string is run on them.

1. different, same
2. unique, different
3. same, different
4. same, same

Correct answer: same, same

Q3. In which of the following machine, the length of output string is 1 more than that of input string?

1. Non-deterministic finite automaton
2. Moore machine
3. Finite automaton with output
4. Mealy machine

Correct answer: Moore machine

Q4. In Mealy machine the output depends on __________________

1. Present state and Present input
2. Type of input
3. Only present state
4. Nothing

Correct answer: Present state and Present input

Q5. Melay machine to increase the output string in magnitude by 1 is called:

1. Decrementing machine
2. Converting machine
3. Complementing machine
4. Incrementing machine

Correct answer: Incrementing machine

Q6. If we have an NFA having 3 states, and we convert that NFA to an FA. The resultant FA will contains _______ states.

1. 2
2. 3
3. 5
4. 4

Correct answer: 4

Q7. In NFA having multiple transitions at certain state, FA can be built by introducing:

1. Empty state
2. Combination of states
3. Final state
4. Initial state

Correct answer: Combination of states

Q8. Consider we have languages L7 and L6. Which of the following represents their concatenation?

1. L6*L7
2. L7+L6
3. L7L6
4. L7/L6

Correct answer: L7L6

Q9. The complement of a regular language is also __________.

1. irregular
2. regular
3. irregular but finite
4. irregular but infinite

Correct answer: regular

Q10. FA corresponding to an NFA can be built by introducing a state corresponding to the combination of states, for a letter having

1. none of the given options
2. no transition at certain state
3. more than one transitions at certain state
4. one transition at certain state

Correct answer: more than one transitions at certain state