Theory Of Computation complete course Bangla (Beginner to Advanced)

এই ভিডিও সিরিজে আশা করি Theory Of Computation বিষয়টাকে সহজে সহজে উপস্থাপন করতে পেরেছি। যদি আমার ভিডিওগুলো থেকে কোন কিছু শিখতে পারেন, তবে অবশ্যই আমার ভিডিওগুলো সবার সাথে শেয়ার করে আমাকে কৃতজ্ঞ করবেন । আমার এই কষ্টার্জিত কাজগুলো সবার কাছে পৌঁছে দেয়ার দায়িত্ব আপনার ।

team

Introduction to Theory of Computation

team

Symbol, Aphabet & String

team

Language

team

Finite automaton

team

Introduction to DFA

team

Formal definition of DFA's

team

DFA of strings which starts with 'a'

team

DFA of strings which starts with 'aa'

team

DFA of strings which starts with 'aab'

team

DFA of strings which starts with '10'

team

DFA of strings contains 'a'

team

DFA of strings which contains 'ab'

team

DFA of strings which contains '001' as substring

team

DFA of strings which contains 'baba' as substring

team

DFA of strings which ends with an 'a'

team

DFA of strings which ends with an 'ab'

team

staring and ending with different symbol

team

staring and ending with same symbol

team

every 'a' is followed by 'b'

team

every 'a' is never be followed by 'b'

team

every 'a' is followed by 'ab'

team

every 'a' is never be followed by 'ab'

team

every '0' is followed by at least one '1'

team

DFA of string length exactly 2

team

DFA of string length at least 2

team

DFA of string length at most 2

team

Introduction to minimal DFA

team

Length of string is divisible by 2

team

Length of string is not divisible by 2

team

Length of string is divisible & not divisible by 3

team

Length of string is divisible & not divisible by 4

team

string has exactly,atleast & atmost 2 'a's

team

string has even & odd number of 'a's

team

number of 'a's is divisible & not divisible by 2

team

Complementation of DFA

team

dfa construction 1

team

dfa construction 2

team

dfa construction 3

team

dfa construction 4

team

2nd,3rd,4th symbol from LHS is ‘a’.

team

Binary number is divisible by 2

team

Binary number is divisible by 3

team

Binary number is divisible by 4

team

Strings starts with 0 and has odd length

team

w | w is any string that accept a or b

team

w | w is any string that accept 11 or 111

team

Regular Language , operation (union operation)

team

union operation example 2

team

Intersection operation example 1

team

intersection operation example 2

team

Minimization of dfa example 1

team

Minimization of dfa example 2

team

Minimization of dfa example 3

team

Minimization of dfa example 4

team

Minimization of dfa example 5

team

Introduction to NFA

team

NFA of string length exactly 2,at least 2,at most 2

team

NFA Examples 1

team

NFA examples 2

team

NFA to DFA conversion example 1

team

NFA to DFA conversion example 2

team

NFA to DFA conversion example 3

team

NFA to DFA conversion example 4

team

NFA to DFA conversion example 5

team

NFA to DFA conversion example 6 (part-I)

team

NFA to DFA conversion example 6 (part-II)

team

NFA to DFA conversion example 7

team

Epsilon NFA to DFA conversion example 1

team

Epsilon NFA to DFA conversion example 2

team

Formal definition of Regular Expression

team

Regular Expression to nfa Example 1

team

Regular Expression to nfa Example 2

team

Regular Expression to nfa Example 3

team

Regular Expression to nfa Example 4

team

Context Free Grammar (Part-1)

team

Context Free Grammar (Part-2)

team

Context Free Grammar (Part-3)