Csit Notes

https://youtu.be/maXLitXc_dE

Convert Epsilon-Nfa (ε-nfa) into Dfa.In Neplai. Facebook: https://www.facebook.com/csitnotes1/Email: [email protected] YOU FOR WATCHING___________________________________________Please like sha...

Nabin Pandey

Discrete Structures (Discrete Mathematics ) Bsc.Csit 2rd Sem | Chapter 1 | PDF LINK:https://nabinpandey0.blogspot.com/2022/03/discrete-structures-discrete.html

https://youtu.be/6WMFGjLMyno

Convert NFA to DFA example 2 . How to convert. 1. This lecture shows how NFA and DFA are equivalent and how to convert an NFA to its equivalent DFA.

https://www.youtube.com/watch?v=N9M9lQZ4wEs&ab_channel=CsitNotes

Convert NFA to DFA with example in Nepali. How to convert. TOC: Conversion of Non-deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA).Topics discussed:1. This lecture shows how NFA and DFA are ...

https://youtu.be/Y9A5Jqf6WMY

Design the DFA that accept strings 001 or 101. Nepali .Nepali

https://youtu.be/WpCRCbgd7B4

Design the DFA that accept strings starting with a and ending with b in Nepali Design the DFA that accept strings starting with a and ending with b in Nepali

https://www.youtube.com/watch?v=TG661loZ-P4

Design the DFA that accept strings ending with 01. Neplai (Example 1) DesigntheDFAthatacceptstringsendingwith01.Neplai (Example 1)

https://youtu.be/eZLe2QfhKQE

What is DFA in TOC with examples .Nepali Topic Discussed: How to construct DFA with example

https://youtu.be/wa4uLpa2MRA

https://youtu.be/MnlQRiQqy8o

Chinese remainder theorem (Find The value Of X).Nepali. The Chinese remainder theorem is a theorem which gives a unique solution to simultaneous linear congruences with coprime moduli. In its basic form, the Chine...

https://youtu.be/c6yg27MvMrc

Maximum Flow Minimum cut Theorem [Ford Fulkerson Algorithm].Nepali. topic is ford fulkerson algorithm for calculating max flow in Nepali .. In this vi...