**Automata** theory (also known as **Theory Of Computation**) is a theoretical branch of Computer Science and Mathematics, which mainly deals with the logic of computation with respect to simple machines, referred to as automata.

Automata* enables the scientists to understand how machines compute the functions and solve problems. The main motivation behind developing Automata Theory was to develop methods to describe and analyse the dynamic behavior of discrete systems.

Automata is originated from the word “Automaton” which is closely related to “Automation”.

Now, let’s understand the basic terminologies, which are important and frequently used in Theory of Computation.

**Symbol:**Symbol(often also called**character**) is the smallest building block, which can be any alphabet, letter or any picture.

**Alphabets**(**Σ**)**:**Alphabets are set of symbols, which are always.**finite**

**String:**String is asequence of symbols from some alphabet. String is generally denoted as**finite**and length of a string is denoted as**w**.**|w|****Note:**Σ* is set of all possible strings(often power set(need not be unique here or we can say multi set) of string) So this implies thatΣ*.**language**is a subset of

Empty string is the string with zero occurrence of symbols, represented as ε.

Number of Strings (of length 2) that can be generated over the alphabet {a, b}-- -a a a b b a b b Length of String |w| = 2 Number of Strings = 4Conclusion:For alphabet {a, b} with lengthn, number of strings can be generated =2.^{n}

**Note –**If the number of Σ’s is represented by |Σ|, then number of strings of length n, possible over Σ is**|Σ|**.^{n}**Language:**A language is a*set of strings*, chosen from some Σ* or we can say-**‘**A language is a subset of Σ***‘**. A language which can be formed over ‘ Σ ‘ can be**Finite**or**Infinite**.

Attention reader! Don’t stop learning now. Learn all **GATE CS concepts with Free Live Classes** on our youtube channel.