The document Introduction - Theory of Computation Computer Science Engineering (CSE) Notes | EduRev is a part of the Computer Science Engineering (CSE) Course Theory of Computation.

All you need of Computer Science Engineering (CSE) at this link: Computer Science Engineering (CSE)

**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.**Theory Of Computation**

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:**

**1. Symbol:** Symbol is the smallest building block, which can be any alphabet, letter or any picture.

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

**3. String:** String is a **finite **sequence of symbols from some alphabet. String is generally denoted as

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} -

Length of String |w| = 2

Number of Strings = 4

**Conclusion:**

For alphabet {a, b} with length n, 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}**.

**4. 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**.

**5. Powers of ‘Σ‘:**

Say Σ = {a,b} then**Σ ^{0}** = Set of all strings over Σ of length 0. {ε}

i.e. |Σ

Σ* = Σ

= {ε} U {a, b} U {aa, ab, ba, bb}

= ............. //

Offer running on EduRev: __Apply code STAYHOME200__ to get INR 200 off on our premium plan EduRev Infinity!

36 videos|39 docs|39 tests

### Introduction to Theory of Computation

- Video | 11:35 min
### Proving Techniques

- Doc | 5 pages
### Recursive Function Theory

- Doc | 10 pages
### Computable and Non-Computable Functions

- Doc | 2 pages
### PPT - Introduction and Automata

- Doc | 23 pages
### Formal Representation of Languages

- Doc | 7 pages