Consider the statements below: S1: A Finite automata has no memory at all. S2:…

 Consider the statements below:

S1: A Finite automata has no memory at all.

S2: A Finite automata has a limited memory.

S3: For all Moore machines we have an equivalent Finite automaton.

Which of the following statements is/are TRUE

Answer: D. Only S2 and S3Statement S1 is false because Finite Automata have finite memory stored in their states. Statement S2 is true as the number of states limits the memory…

  1. A.

     Only S2

  2. B.

    Only S1 and S3

  3. C.

    Only S1 and S2

  4. D.

    Only S2 and S3

Attempted by 363 students.

Show answer & explanation

Correct answer: D

Statement S1 is false because Finite Automata have finite memory stored in their states. Statement S2 is true as the number of states limits the memory capacity. Statement S3 is True because In Moore machines we can ignore outputs and it will start behaving like finite Autometa.

Explore the full course: Isro

Loading lesson…