DB 4 Automata Theory, Grammars and Languages

he behavior of a finite state machine can be represented in a state transition table. The Unit 4 DB assignment instructions give you a state transition table. The rows contain all of the possible states, in this case A, B, and C. Each column contains each possible input, in this case X and Y. If you look in this table, each entry shows you what the next state should be given the current state and an input. This table shows you how the machine should transition given a condition. There are examples in the book that will help you understand how to read a state transition table and what a corresponding digraph would look like. Automata digraphs were covered earlier in Chapter 8. Chapter 8 is a short chapter but contains everything you need to complete this discussion.