What you will learn

Course will give foundation to Theory of Computation

Basic Concepts on Theory of Computation

Understand the most important concepts to start learning Theory of Computation

Problems to give better understanding

Students will start loving the subject

Description

Theory of Computation is treated as a tough subject by Computer Science Students. But it is a beautiful subject .If you understand the concepts thoroughly it is very easy to learn. The subject has got it’s applications in compiler design and in designing many computational models

I have tried to co-relate this subject with our English language.

The purpose of this course is any student who wants to learn computation  must understand the concepts and get the base right. There are lot of research  potential  too. It should be studied by Computer Science, Mathematics and Linguistic  students

We have divided into three sessions.

Session 1 covers Strings, Alphabets, Empty String, Difference between ,null set and epsilon, substrings of  string, easy way to calculate substrings from  a string ,Prefix-Leading ,Suffix and Trailing characters .I have worked out some questions so that students understand these concepts thoroughly


Get Instant Notification of New Courses on our Telegram channel.


Session 2 covers Grammar, Sentence ,Production, Sentential form, Non Terminals, Terminals and all

Session 3  covers Chomsky Hierarchy Type 0,Type 1,Type 2 ,Type 3 .Subset ,Superset ,Accepting Machines .Language generated by each Grammar or type. Machine accepting each class of Language. Restrictions imposed on each types etc.

I have also included assignments for students to learn so that they can work out and ensure that they get the basics

right

English
language

Content

Introduction

Intro Video

Strings Substrings

Strings ,Substrings

Grammar

Grammar

Chomsky Hierarchy

Chomsky Hierarchy

Section 5

Conclusion