Formal Language And Automata: Finite Automata And Re

Formal Language And Automata: Finite Automata And Re
Published 3/2025
MP4 | Video: h264, 1920×1080 | Audio: AAC, 44.1 KHz

Theory of Computation

What you’ll learn

Deterministic Finite Automata

Non-deterministic Finite Automata

Conversion of NFA to DFA and Epsilon NFA to DFA

Regular Expressions

Requirements

Basic Mathematical Knowledge

Description

Overview

Section 1: Deterministic Finite Automata

Lecture 1 Basic Definitions in Automata

Lecture 2 DFA with Example

Lecture 4 DFA Example: Substring "101"

Lecture 5 DFA Example: Does not contain substring "101"

Lecture 6 DFA Example: Binary String is even

Lecture 7 DFA Example: Divisible by 3

Lecture 8 DFA Example: Even 0’s and Even 1’s

Lecture 9 Extended Transition Function for DFA

Section 2: Non-Deterministic Finite Automata and Conversions

Lecture 10 NFA with Example

Lecture 11 NFA Example

Lecture 12 Extended Transition Function for NFA

Lecture 13 NFA to DFA Conversion

Lecture 14 NFA to DFA : Another Example

Lecture 15 ε-NFA

Lecture 16 ε-Closure

Lecture 17 Conversion of ε-NFA to DFA

Lecture 18 Minimized DFA

Section 3: Regular Expressions

Lecture 19 Introduction to Regular Expression

Lecture 20 RE to Epsilon-NFA Conversion

Lecture 21 DFA to RE Conversion

Lecture 22 DFA to RE Example1

Lecture 23 DFA to RE Example2

Lecture 24 Pumping Lemma for Regular Languages

Lecture 25 Pumping Lemma: Example 1

Lecture 26 Pumping Lemma: Example 2

Computer Science and Engineering Students