Question theory of automata from Mishra CHAPTER 3

 Question theory of automata from Mishra CHAPTER 3 

1. DEFINITION OF AN AUTOMATON

2. TRANSITION SYSTEMS

3. PROPERTIES OF TRANSITION FUNCTIONS

4. ACCEPTABILITY OF A STRING BY A FINITE

AUTOMATON

5. NONDETERMINISTIC FINITE STATE MACHINES

6. A string W E L* is accepted by NDFA At if o(q(j, w) contains

some final state.

7. THE EQUIVALENCE OF DFA AND NDFA

8. MEALY AND MOORE MODELS

9. PROCEDURE FOR TRANSFORMING A MEALY MACHINE

INTO A MOORE MACHINE.

10. PROCEDURE FOR TRANSFORMING A MOORE MACHINE

INTO A MEALY MACHINE.

11. MINIMIZATION OF FINITE AUTOMATA