Automata

Regular Expression:
Regular languages and regular expression over ∑.
The set R of regular languages over ∑ and the corresponding regular
expressions are defined as follows.
1- ∅ is an element of R and the corresponding regular expression is ∅.
2- {∧} is element of R and the corresponding regular expression is ∧.
3- For each a∈∑ , {a} is an element of R and the corresponding regular
expression is a.
4- If L1 and L2 are any element of R and r1 and r2 the corresponding regular
expressions,
a. L1 U L2 is an element of R and the corresponding regular
expression is (r1 + r2).
b. L1.L2 is an element of R and the corresponding regular expression
is (r1.r2).
c. L1* is an element of R and the corresponding regular expression is
(r1*)
Only those language can be obtained by using statements 1- 4 are regular
language over ∑ .

Finite Automata:
A finite automaton or finite state machine (abbreviation FA) is a 5-tuple
M = (Q, Σ, q0, A, S) where,
1- Q is a finite set, (whose elements we will think of as states);
2- ∑ is a finite alphabet of input symbols;
3- q0∈Q (the initial state);
4- A≤Q (the set of accepting state);
5- S is a function from Qx∑ to Q (the transition function);
For any element q of Q any symbol a∈∑, we interpret S(q,a) as the state to which
the FA moves, if it is in state q and receive a.