CS402 Quiz 4 by Mubi

Q1. A loop at a state is supposed to be ---------- transition while converting Moore machine into an equivalent Melay machine.

1. Both incoming and outgoing
2. Incoming
3. Outgoing
4. Complex

Correct answer: Incoming

Q2. A non regular language can be represented by

1. TG
2. RE
3. FA
4. None of the given options

Correct answer: RE

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

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

Correct answer: regular

Q4. Which one of the following machine is represented as a pictorial representation with states and directed edges labeled by an input letter along with an output character?

1. Finite state machine
2. Mealy machine
3. Moore machine
4. Deterministic finite state machine

Correct answer: Mealy machine

Q5. If R is regular language and Q is any language (regular/ non-regular), then Pref( _______in _______) is regular.

1. R,R
2. Q,R
3. Q,Q
4. R,Q

Correct answer: R,Q

Q6. If an FA accepts a word then there must exist a path from __________.

1. Initial to final state by traversing each state
2. Initial to final state
3. Initial to each state
4. Initial to each state but not to final state

Correct answer: Initial to final state

Q7. Finite Automaton (FA) must have __________ number of states while a language has _________ words.

1. finite, finite
2. infinite, finite
3. infinite, infinite
4. finite, infinite

Correct answer: finite, infinite

Q8. The CFG is said to be ambiguous if there exist at least one word of its language that can be generated by ______ production tree(s).

1. More than one
2. At most one
3. One
4. Zero

Correct answer: More than one

Q9. The language L defined over Σ, not belonging to L, is called _______ of the language L.

1. complement
2. union
3. intersection
4. closure

Correct answer: complement

Q10. Which of the following represent the absence and presence of current in sequential circuit respectively?

1. 0, 1
2. 1, 1
3. 1, 0
4. 0, 0

Correct answer: 0, 1