Theory of Computation Quiz

In Moore machine, output is produced over the change of:

• transitions

• states

• all of the mentioned

• none of the mentioned

In a Mealy machine, output is produced over the change of:

• transitions

• states

• both transitions and states

• none of the mentioned

Which of the following is true about finite state machines?

• They can only recognize regular languages

• They are not used in computer science

• They can have an infinite number of states

• They can be implemented using a stack

What is the primary difference between a Moore machine and a Mealy machine?

• There is no difference

• Mealy machines have more states than Moore machines

• Moore machines are faster than Mealy machines

• Output depends on states in Moore, transitions in Mealy

Number of states require to accept string ends with 10.

• 3

• 2

• 1

• 0

Which of the following statements is true regarding deterministic finite automata (DFA)?

• They cannot recognize all regular languages

• They can be converted to non-deterministic finite automata (NFA)

• They can have multiple transitions for the same input

• They require more states than NFA for the same language

In a finite state machine, what is the role of the transition function?

• To define the output for each state

• To determine the next state based on current state and input

• To initialize the machine

• To accept or reject the input string

Regular expression for all strings starts with ab and ends with bba is.

• aba*b*bba

• ab(ab)*bba

• ab(a+b)*bba

• ab(a+b)ba

In a finite state machine, what does it mean for a state to be accepting?

• This state has no outgoing transitions

• The input string is accepted if the machine ends in this state

• The machine can transition to this state

• The machine will produce an output

There are ________ tuples in finite state machine.

• 4

• 5

• 6

• 7