4.7. DFA for length of string divisible by 3.

preview_player
Показать описание
Technical lectures by Shravan Kumar Manthri.
Watch Top 100 C MCQ's

Watch Technical C programming

Watch Data Warehousing & Data Mining

Watch Design & Analysis of Algorithms

Watch Formal Languages & Automata theory

Like us on fb: CSE GURUS

This video explains DFA problems with explanation. #ShravankumarManthri#CSEGURUS #ShravankumarManthri#CSEGURUS
  1. CSE GURUS
  2. dfa of length 2
  3. Shravankumarmanthri
  4. gate cse lectures in english
  5. flat lectures
  6. finite automata with example
Рекомендации по теме
7 DFA accepting 0:02:11

7 DFA accepting exact length of 1 or 3

4.7. DFA for 0:08:39

4.7. DFA for length of string divisible by 3.

Draw a DFA 0:03:41

Draw a DFA for the set of strings that have a length of at least 4. ∑ = {a, b}

TOC Lecture -2.13 0:06:17

TOC Lecture -2.13 DFA Length Of String Mod By

DFA with Modulo 0:46:16

DFA with Modulo Arithmetic Notations

Lecture 7: Construct 0:09:33

Lecture 7: Construct DFA where length of each input string is atmost n

Lec-12: DFA of 0:07:26

Lec-12: DFA of all binary strings divisible by 3 | DFA Example 5

L 4: Construct 0:14:57

L 4: Construct DFA over alphabets {a,b} for Language L consists strings whose length is exactly &apo...

Minimal DFA | 0:04:38

Minimal DFA | Length of String | Number of 0's in a length of string is not divisible by 4

Design DFA to 0:10:18

Design DFA to accept all Binary Strings which are divisible by 4 ( Four ) || Theory of computation

4.10. DFA for 0:07:23

4.10. DFA for even length of a and b

08-DETERMINISTIC FINITE AUTOMATA 0:15:49

08-DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 4 (STRING LENGTH) IN AUTOMATA THEORY || TOC

Construct DFA of 0:03:16

Construct DFA of Odd/Even Length String | The Complete Guide to NFA/DFA | GeeksforGeeks GATE

6 DFA accepting 0:04:22

6 DFA accepting strings of length 1 and 2

FAFL | TOC 0:10:03

FAFL | TOC Unit-1 Lecture-5 DFA construction- String length modulo k problems

Lec-7: DFA Example 0:08:12

Lec-7: DFA Example 1 | How to Construct DFA in TOC

DFA which accepts 0:06:07

DFA which accepts all strings of at least length 2

Deterministic Finite Automata(DFA) 0:09:46

Deterministic Finite Automata(DFA) with (Type :Divisibility problems)examples

Miscarriage Timeline Breakdown 0:00:24

Miscarriage Timeline Breakdown

DFA accepts String 0:02:01

DFA accepts String of Length 2 | Theory of Computation | Ashish Chandak

L 14: Construct 0:05:26

L 14: Construct a DFA over alphabets {a,b} for Language L contains strings of EVEN length.

Lecture 9: Construct 0:13:49

Lecture 9: Construct DFA where length of input string is not divisible by some number n

Job l Banglore 0:00:07

Job l Banglore l Amazon

Construct DFA of 0:09:43

Construct DFA of length 2 String | The Complete Guide to NFA/DFA | GeeksforGeeks GATE

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

These videos from 5 years ago are super helpful for my learning right now...We have a course in uni named "automat, language and complexity", and we never have specialized training for these cases, professor or tutor never gonna give us the method of how to do these tasks, only answers no methods to explain....But we do have these things in exam...Your methods for dfa and pushdown automat and algorithmus are super helpful, thank you so much man....

leyao
Автор

Very nice !! I like how u focus on actual problems rather than theory, very helpful for exams.

cosmonerdsid
Автор

What you have constructed is a NFA not a DFA. Yeah, I know that one can be converted into the other, but the question specifically asks us to construct a DFA.

fieryflowers
Автор

if it 3 the its an even length, then the final state will be q1 in the answer of the question you have done

NatureStudio
Автор

But here div by 3 means it's a odd lenth than the final state should be q0 rights?

ruchithaveeramallli
join shbcf.ru