Monday, May 27, 2019
Home > Theory Of Computation > Day 2: Theory Of Computation Introduction

# Day 2: Theory Of Computation Introduction

Theory Of Computation Is Also Known As Core Subject Of Computer Science. If You Are A Logical Thinker, If You Love To Learn Mathematics, This Subject Is Very Easy For You.

Let’s Understand The Importance Of Theory Of Computation(TOC) In Computer Science And Basic Terminologies Used In Theory Of Computation.

## First We Have To Know What Is Mean By Symbol ?

You’ll Be Seeing Lot Of Symbols In Your Day-to-Day Life, If You Observe The Keyboard You’ll Be Seeing A-Z Alphabets And 0-9 Numbers. And You’ll Be Seeing Special Characters, All These Are Considered As Symbols. Every Symbol On The Keyboard Has Specific Meaning.

Symbols – A,B,C 0,1,2 @,#,\$(,)

## What Is Alphabet?

We Represent Alphabets With ” “, You May Have Seen This Symbol In Mathematics While Doing SUM. Here We Will Represent Alphabets With ” ∈ “

The Meaning Of ” ∈ ” Is A Particular Domain’s Symbol.

Alphabet As The Set Of Symbols Example – {a, b}, Which Are Always Finite

## What Is String?

String Is A Combination Of Alphabet, Any Number Of Times Is Called As String.

Example – ∈ ={a,b}   // Converting Alphabet To String

Set Of = {aa,ba,bb,aba,bba….}  // This Is String

## What Is Language?

A Language Is A Combination Of Strings On Given Certain Conditions.

Example – ∈ = {a,b} // Input Alphabet

Using The Above Alphabet, You Have To Create String With The Length Of 2.

L1=Set Of All The Strings Of Length 2

= {aa,ab,bb,ba}

• This Set Is Called As Finite Set, Any Set In Which We Can Count Elements Is Called Finite Set Because We Have Finite Number Of Elements In The Set.
• Using The Language We Created This Finite Set, Where The Set Contains Countable Elements, This Language Is Called As Finite Language.

Example 2

∈ = {a,b}

L2= Set Of All Strings Starts With ‘ a ‘

= { a,aab,aab,aba,abba,abab,…….}

• This Set Is Called As InFinite Set, Any Set In Which We Can Not Count Elements Is Called InFinite Set Because We Have InFinite Number Of Elements In The Set.
• Using The Language We Created This InFinite Set, Where The Set Contains UnCountable Elements, This Language Is Called As InFinite Language.

In This Post, We Have Understood About Symbol, Alphabet, String, Language.I Hope You Understood If You Have Any Doubts Comment Below.

## One thought on “Day 2: Theory Of Computation Introduction”

1. I have not checked in here for a while as I thought it was getting boring, but the last few posts are great quality so I guess I¦ll add you back to my daily bloglist. You deserve it my friend 🙂