The Transition Graphs (TG) differ from FA in the following areas

• TG’s are generalizations of FA’s.
• TG’s can change state without an input ( Null transition).
• Can READ more than one letter (words of the LANGUAGE they are accepting) along the transition edges at a time.
• Can have a regular expression as a edge label.
• Can have more then one START state.

We have been given more freedom in TG’s. But this freedom is on the cost of more memory and processing power it means that if we implement TG’s on computer using some programming language it will NEED more memory and processing power of computer than used in the implementation of FA’s.

The Transition Graphs (TG) differ from FA in the following areas

We have been given more freedom in TG’s. But this freedom is on the cost of more memory and processing power it means that if we implement TG’s on computer using some programming language it will need more memory and processing power of computer than used in the implementation of FA’s.