State Diagrams are extensively used in compiler theory, finite state machines, transition diagrams

State Diagrams are extensively used in compiler theory, finite state machines, transition diagrams.

Circles indicates states (nodes,vertices)

Bunch of circles are called states and arrows are called as transitions(edges,links).

Alphabet ={finite set of symbols}

Word(string) = sequence of symbols from alphabet

Empty string=No words

Language is a set of words.

Regular Languages: A set of languages that can be processed with state machines.

Acceptor Function of a Language is a Boolean function that will accept a string as an argument and will return a true if the string is a member of a language.

A language is generated by a final state machine(FSM).

Oval: + A

Like this image