TOC Lec 15 - Part 1 - DFA to Regular Expression (State Elimination Method) by Deeba Kannan

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

Рекомендации по теме

Комментарии

Really when I come to india I will visit you and thank you personally you are my best friend in the world

mrclubshorts

Thank you so much! You are an absolutely outstanding teacher and your explanations of these complex subjects are really clear and accessible.

matttantony

Thanks for this Theory of Computation video! Is there a problem that you want to see done?

EasyTheory

Thanks for demonstrating the State Elimination Method!

gmarifislam

Nameste You teach a lot better than my professor . Good work !

curesnow

Thank you Maam for ur wonderful explanation..

-Abdulrasheed

you saved my life! thank you and keep it up!

narjesalaa

Really good explanation
Worth to watch your videos

adarshrnaik

Thank you mam....you explaind it easily

rayhanmahmud

Thank you so much
Very helpful and well explained

RamboMutambo

thank you very much! a very informative and easy to follow video.

DDParadise

Thank you ma'am. Your explanation is too good

amitttooo

Excellent mam, Thank you very much!! May god help

sankarayachitula

Tank you so Much. It's my exam time and u helped Me a lot.

vooranitish

Can we perform union operation at end write in single line?

MM-ssgg

If you have given dfa example then dfa must show transition for all its input letters but you have not mention, second mistake you have made is you haven't shown initial and final state. It's very necessary to show the -, + symbols.

redrose

I'm a little confused about the DFA representation of A*B. I thought we needed epsilon transitions when dealing with the star operator?

evanlecarde

Mam y there is 2 parts in state elimination method mam...tat is the previous video and this video...which v have to follow..pls tell mam am confused

RanjithR-dnkq

please upload more examples about pumping lemma and push down automata and turing machines please

mrclubshorts

Mam, Can We simplify the last line in this case?

shoyebahmedrussel

TOC Lec 15 - Part 1 - DFA to Regular Expression (State Elimination Method) by Deeba Kannan

TOC Lec 15 - Part 1 - DFA to Regular Expression (State Elimination Method) by Deeba Kannan

TOC Lec 15-Part 2 - DFA to RE State Elimination Method by Deeba Kannan

TOC Lec 15 - Part 3 - DFA to RE using State Elimination method

NFA example | Part-2 | TOC | Lec-15 | Bhanu Priya

Lec-15: Design NFA of all binary strings in which 2nd last bit is 1 | NFA Designing | TOC in Hindi

TOC Lec-15 Deterministic Finite Automata (DFA) part-1

TOC | Construct 50 Finite Automata for 50 Regular Languages | Lec 15 | GATE CSE Exam

Lec-15 I UNIT-1 Theory of Automata and Formal Languages I TAFL I GATEWAY CLASSES I AKTU

LEC-15 || Solving Q15 || Theory of Computation (ToC)

Lec-15 | Part-3 |Accept a set of all strings for |w|x mod n = r | The gate school | TOC | DFA

Lec 15 DFA Examples Part-2 || Theory of Computation (TOC) || CS & IT || GATE-2023-24

dfa example with solution | Part-3 | TOC | Lec-12 | Bhanu Priya

Deterministic Finite Automata|Lec-15||Divisible by Modulo-K problems|dfsm

TOC lec15

CS2200 LMC | Lec 15 | Decision properties of regular languages

Theory of Computation (TOC) | NFA with and without Epsilon moves | Lec 15 | GATE CSE Exam

TOC Lec - construction of DFA,PDA and TM for a Regular Language

TOC Lec 02-NFA and DFA by Deeba Kannan

derivation in theory of computation | TOC | Lec-52 | Bhanu Priya

LEC-15 || Question-15 || TOC

regular expression | Examples | TOC | Lec-41 | Bhanu Priya

Lec 15 | Minimization of DFA | TOC THEORY OF COMPUTATION | AUTOMATA | COMPUTER SCIENCE

TOC Lec 24 - Elimination of useless symbols in Context free grammar by Deeba Kannan

TOC DFA LEC 15