Introduction to Finite Automata

preview_player
Показать описание

  1. Theory of Computation
  2. Introduction
  3. to
  4. Finite
  5. Automata
Рекомендации по теме
Introduction to Finite 0:29:44

Introduction to Finite Automata

1. Introduction, Finite 1:00:34

1. Introduction, Finite Automata, Regular Expressions

4 introduction to 0:04:30

4 introduction to finite automata

Regular Languages: Deterministic 0:06:28

Regular Languages: Deterministic Finite Automaton (DFA)

Finite State Machine 0:11:05

Finite State Machine (Finite Automata)

Finite Automata Model 0:04:46

Finite Automata Model || Formal Definition || TOC || FLAT || Theory of Computation

A-Level Comp Sci: 0:08:21

A-Level Comp Sci: Finite State Machine

Finite State Automata 0:00:55

Finite State Automata - 1 - Introduction

finite automata | 0:04:26

finite automata | TOC | Lec-6 | Bhanu Priya

Introduction to Finite 0:24:13

Introduction to Finite State Machine Theory

Intro to Finite 0:13:14

Intro to Finite Automata (Brief Intro to Formal Language Theory 8)

Introduction to Finite 0:08:21

Introduction to Finite Automata

Introduction to Finite 0:06:08

Introduction to Finite Automata

Lec-3: What is 0:05:18

Lec-3: What is Automata in TOC | Theory of Computation

Video 1 Introduction 0:08:59

Video 1 Introduction to Finite Automata | TOC Masterclass| Sridhar Iyer

Theory of Computation 0:14:15

Theory of Computation | Important Basic Concepts | Introduction to Finite Automata

What is Finite 0:05:16

What is Finite Automata (FA) Explained With Examples in Hindi ll Theory Of Computation(TOC)

INTRODUCTION TO AUTOMATA 0:09:23

INTRODUCTION TO AUTOMATA THEORY AND ITS APPLICATIONS || THEORY OF COMPUTATION || FORMAL LANGUAGES

Lecture 1:Introduction to 0:09:48

Lecture 1:Introduction to Automata Theory|Finite Automata and Formal Languages|Theory of Computation

Deterministic Finite Automata 0:09:48

Deterministic Finite Automata (Example 1)

Introduction to finite 0:11:39

Introduction to finite state machines for digital logic

Conversion of Regular 0:08:54

Conversion of Regular Expression to Finite Automata - Examples (Part 1)

Lecture 6: Introduction 0:17:01

Lecture 6: Introduction to Finite Automata (NFA and DFA)

INTRODUCTION ABOUT FINITE 0:02:57

INTRODUCTION ABOUT FINITE AUTOMATA WITH OUTPUT - #TOC - 19

Комментарии
Автор

Never felt Automate would be this much simple... Thank you very much sir.. :)

harishsinghghughtyal
Автор

fun fact: pen and paper is a storage device, our brain is the computing one.

jaisuriyar
Автор

I think there should be an update of this course now, by the same professor. BTW this is an awesome course.

varunkumar
Автор

Irony in having a computer science class with writing using a chalk.

-rpm
Автор

sir pls increase your volume even after keeping max volume i am missing your words

FaizShaikh-vdrm
Автор

16:01
@1st c: 1, 2nd c: 2, 3rd A: back to 1, 4th C: 2, 5th C: 3, 6th A: back to 2, 7th C: 3

AfzalAlis
Автор

is this course good for semester exam?

ashtrians
Автор

7:02 mins u said Pen and paper is a computational device. Which is a completely false statement. If we write 1+2 on paper it ain't gonna give 3 as output by itself. We are the one who is writing the output 3 on paper after calculating the problem. How can a thing which has no computational power can be a computational device? We use pen and paper to note the current progress of the problem that doesn't mean pen and paper will become a computational device.

deepjyoti
Автор

Can anyone tell me why he just did 3 addition typo thing at 28:06 and in the next example he did 4 repetitions. Like why and how?

Quiet_Wanderer
Автор

23:32 is a what ? Sir please explain, the dfa can be made just by 3 states

indiancoder
Автор

NPTEL MAKES ME TO FEEL LIKE I AM AN IIT STUDENT😊

snehalathareddy
Автор

Can anyone explain @ 22:34 How to take those 4 states and why?

sahanasshenoy
Автор

He is panicked, and he messed up at 16.10😅.

pruthvi
Автор

I really appreciate lectures coming online but it wont be useful if they dont have some spark in them ... I tried watching lecture for sometime 8-10 minutes but got bored .. i switched to an another lecture from university of California and found that interesting .. I think we are missing some real delivery issue of the material .. teachers keep on writing on the board and say it repeatedly. It is annoying and hence people loose focus .. this thing i have felt from long ago .. I am currently watching cryptography with Christof paar and they are damn interesting . So this is just a feedback to nptel team .. I hope you guys consider this

Palash
Автор

do the 40 lectures covers all the topic in gate?

divyarathore
Автор

anyone is having notes of these lecture please share

ankushbanik