0(0)

FORMAL LANGUAGES AND AUTOMATA THEORY

  • Course level: All Levels

Description

Formal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages infinite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in the construction of compilers and designing of programming languages, thus establishing the course as a core paper in the third/fourth year of various universities.

The Highlights of this Formal Languages and Automata theory course:

1.Introduction to Automata theory.

2.Types of Formal Languages(Chomsky hierarchy).

3.Finite Automata and Types.

4.Total 22 DFA problems and solutions clearly explained.

5. DFA Conversions,Operations & Equivalence.

6. DFA minimization using

a. Equivalence method.

b.Table filling method.

6. Pushdown Automata.

7.Total 8 PDA problems and solutions clearly explained.

8.Turing machines.

9.Total 5 TM problems and solutions clearly explained.

10. Equivalence of 2 DFAs

11. Introduction to Pushdown Automata

12.Total 8 Pushdown Automata problem

Who this course is for:

  1. Computer Science & Engineering and Information technology students

What Will I Learn?

  • Formal Languages and Automata theory

Topics for this course

41 Lessons

FORMAL LANGUAGES AND AUTOMATA THEORY

1. Introduction to Automata theory00:00:00
2. Finite Automata with examples00:00:00
3. Types of Finite Automata and Language acceptance00:00:00
4.1. construct DFA of length 2.00:00:00
4.2. DFA of length atleast 200:00:00
4.3 : DFA of length atmost 200:00:00
4.4. DFA for strings ending with abb00:00:00
4.5. DFA for strings starts with abb00:00:00
4.6. DFA for substring as abb00:00:00
4.7. DFA for length of string divisible by 3.00:00:00
4.8. DFA for number of a’s equal to 200:00:00
4.9. DFA for divisibility00:00:00
4.10. DFA for even length of a and b00:00:00
4.11. DFA for divisibility of a and b00:00:00
4.12. DFA for divisibility in binary00:00:00
4.13. DFA for divisibility in binary by 400:00:00
4.14. DFA for set of all string over 0,100:00:00
4.15. DFA for set of all string s starts and ends with00:00:00
4.16. DFA for set of all strings starts and ends with different symbol00:00:00
4.17. DFA for strings that does not ends with ab00:00:00
4.18. DFA for strings that every a followed by b00:00:00
4.19. DFA for strings that number of a s followed by b’s00:00:00
4.20. DFA for strings that last symbol from Left end00:00:00
4.21. DFA for strings of the form a3bwa300:00:00
4.22. DFA for strings of the form a power n00:00:00
5. NFA TO DFA Conversion00:00:00
6. e-closure of a state00:00:00
7. epsilon NFA to NFA conversion00:00:00
8. DFA Minimization using Equivalence method00:00:00
9. DFA Minimization using Table filling method00:00:00
10. Equivalence of 2 DFAs00:00:00
11. Introduction to Pushdown Automata00:00:00
12.1. Pushdown Automata problem no.100:00:00
12.2. Pushdown Automata problem no.200:00:00
12.3. Pushdown Automata problem no.3 & 400:00:00
12.4. Pushdown Automata problem no.500:00:00
12.5. Pushdown Automata problem no.600:00:00
12.6. Pushdown Automata problem no.700:00:00
12.7. Pushdown Automata problem no.800:00:00
12.8. Pushdown Automata problem no.900:00:00
Turing Maching – Definition , Tuple notation and problems with clear explanation00:00:00
Formal Languages and Automata theory
33 £

Enrolment validity: Lifetime

Requirements

  • Be able to understand Automation.