Study with Soumodeep

CFG to PDA | Example - 1
CFG to PDA | Example - 1
Bayesian Network | Probabilistic Graphical Models | Inference Example 1
Bayesian Network | Probabilistic Graphical Models | Inference Example 1
Bayesian Network | Probabilistic Graphical Models | Total Probabilities
Bayesian Network | Probabilistic Graphical Models | Total Probabilities
Basic COCOMO Model | Intro + Example | Example - 1 | Software Engineering
Basic COCOMO Model | Intro + Example | Example - 1 | Software Engineering
PDA Example - 7 | NPDA Design | Even Palindrome | PDA for L = {WWᴿ | W ∈ (a+b)*}
PDA Example - 7 | NPDA Design | Even Palindrome | PDA for L = {WWᴿ | W ∈ (a+b)*}
Pushdown Automata Example - 6 | PDA for L = {WCWᴿ | W ∈ (a+b)*}
Pushdown Automata Example - 6 | PDA for L = {WCWᴿ | W ∈ (a+b)*}
Pushdown Automata Example - 5 | PDA for L = { aⁿ bᵐ cⁿ | m , n ≥ 1 }
Pushdown Automata Example - 5 | PDA for L = { aⁿ bᵐ cⁿ | m , n ≥ 1 }
Pushdown Automata Example - 4 | PDA for L = aⁿ bⁿ cᵐ (m,n ≥ 1)
Pushdown Automata Example - 4 | PDA for L = aⁿ bⁿ cᵐ (m,n ≥ 1)
Pushdown Automata Example - 3 | PDA for L = aᵐ bⁿ cᵐ⁺ⁿ
Pushdown Automata Example - 3 | PDA for L = aᵐ bⁿ cᵐ⁺ⁿ
Pushdown Automata Example 2 | PDA for aⁿ b²ⁿ (n ≥ 1)
Pushdown Automata Example 2 | PDA for aⁿ b²ⁿ (n ≥ 1)
Introduction to Pushdown Automata | PDA Basics with a^n b^n Example
Introduction to Pushdown Automata | PDA Basics with a^n b^n Example
Regular Expression to NFA to Minimized DFA | Strings Starting with ‘a’ and Ending with ‘b’
Regular Expression to NFA to Minimized DFA | Strings Starting with ‘a’ and Ending with ‘b’
Transition Diagram to Regular Expression | Arden’s Theorem Explained with Example - 2
Transition Diagram to Regular Expression | Arden’s Theorem Explained with Example - 2
Transition Diagram to Regular Expression | Arden’s Theorem Explained with Example
Transition Diagram to Regular Expression | Arden’s Theorem Explained with Example
Regular Expression to NFA to Minimized DFA | Strings Ending with 00
Regular Expression to NFA to Minimized DFA | Strings Ending with 00
Function Point Numerical Example - 1 | Software Engineering
Function Point Numerical Example - 1 | Software Engineering
Introduction to DFA | Mathematical Definition & 3 Basic Examples
Introduction to DFA | Mathematical Definition & 3 Basic Examples
Moore Machine Example | Output 'a' if Ends with 101, 'b' if Ends with 110, Else 'c' (Alphabet {0,1})
Moore Machine Example | Output 'a' if Ends with 101, 'b' if Ends with 110, Else 'c' (Alphabet {0,1})
Convert Regular Expression to NFA | Thompson’s Construction Method
Convert Regular Expression to NFA | Thompson’s Construction Method
NFA Example | Strings with 3rd Last Symbol = 1 over Alphabet {0, 1}
NFA Example | Strings with 3rd Last Symbol = 1 over Alphabet {0, 1}
NFA Example | Strings Ending with
NFA Example | Strings Ending with "aa" over Alphabet {a, b}
DFA Example | Strings with Even Number of 0s and Odd Number of 1s (Alphabet {0,1})
DFA Example | Strings with Even Number of 0s and Odd Number of 1s (Alphabet {0,1})
DFA Example | Accept Strings with at Least Three ‘a’s over {a, b}
DFA Example | Accept Strings with at Least Three ‘a’s over {a, b}
Finite State Machine | Strings with Odd Length Starting with 0 or Even Length Starting with 1
Finite State Machine | Strings with Odd Length Starting with 0 or Even Length Starting with 1
Finite State Machine | Accept Strings Without '11' as a Substring over input Alphabet = {0,1}
Finite State Machine | Accept Strings Without '11' as a Substring over input Alphabet = {0,1}
Finite State Machine: Check if a Binary Number is Divisible by 3
Finite State Machine: Check if a Binary Number is Divisible by 3