ViewTube

ViewTube
Sign inSign up

Sort by

Newest

Oldest

Popular

Turing machine Example - 2 | L = { aⁿbⁿcⁿ / n ≥ 1 }
00:11:50
Turing machine Example - 2 | L = { aⁿbⁿcⁿ / n ≥ 1 }

355 views

2 months ago

Turing machine Example - 1 | L = { aⁿbⁿ / n ≥ 1 }
00:11:58
Turing machine Example - 1 | L = { aⁿbⁿ / n ≥ 1 }

649 views

2 months ago

CFG to PDA | Example - 1
00:12:21
CFG to PDA | Example - 1

151 views

3 months ago

Bayesian Network | Probabilistic Graphical Models | Inference Example 1
00:09:49
Bayesian Network | Probabilistic Graphical Models | Inference Example 1

329 views

4 months ago

Bayesian Network | Probabilistic Graphical Models | Calculating Total Probabilities | Example - 1
00:11:47
Bayesian Network | Probabilistic Graphical Models | Calculating Total Probabilities | Example - 1

492 views

4 months ago

Basic COCOMO Model | Intro + Example | Example - 1 | Software Engineering
00:08:13
Basic COCOMO Model | Intro + Example | Example - 1 | Software Engineering

694 views

4 months ago

PDA Example - 7 | NPDA Design | Even Palindrome | PDA for L = {WWᴿ | W ∈ (a+b)*}
00:15:55
PDA Example - 7 | NPDA Design | Even Palindrome | PDA for L = {WWᴿ | W ∈ (a+b)*}

843 views

4 months ago

Pushdown Automata Example - 6 | PDA for L = {WCWᴿ | W ∈ (a+b)*}
00:14:20
Pushdown Automata Example - 6 | PDA for L = {WCWᴿ | W ∈ (a+b)*}

894 views

4 months ago

Pushdown Automata Example - 5 | PDA for L = { aⁿ bᵐ cⁿ | m , n ≥ 1 }
00:12:45
Pushdown Automata Example - 5 | PDA for L = { aⁿ bᵐ cⁿ | m , n ≥ 1 }

364 views

4 months ago

Pushdown Automata Example - 4 | PDA for L = aⁿ bⁿ cᵐ (m,n ≥ 1)
00:14:08
Pushdown Automata Example - 4 | PDA for L = aⁿ bⁿ cᵐ (m,n ≥ 1)

352 views

4 months ago

Pushdown Automata Example - 3 | PDA for L = aᵐ bⁿ cᵐ⁺ⁿ
00:14:56
Pushdown Automata Example - 3 | PDA for L = aᵐ bⁿ cᵐ⁺ⁿ

257 views

4 months ago

Pushdown Automata Example 2 | PDA for aⁿ b²ⁿ (n ≥ 1)
00:17:29
Pushdown Automata Example 2 | PDA for aⁿ b²ⁿ (n ≥ 1)

350 views

4 months ago

Introduction to Pushdown Automata | PDA Basics with a^n b^n Example
00:19:03
Introduction to Pushdown Automata | PDA Basics with a^n b^n Example

295 views

4 months ago

Regular Expression to NFA to Minimized DFA | Strings Starting with ‘a’ and Ending with ‘b’
00:13:32
Regular Expression to NFA to Minimized DFA | Strings Starting with ‘a’ and Ending with ‘b’

426 views

4 months ago

Transition Diagram to Regular Expression | Arden’s Theorem Explained with Example - 2
00:06:00
Transition Diagram to Regular Expression | Arden’s Theorem Explained with Example - 2

190 views

4 months ago

Transition Diagram to Regular Expression | Arden’s Theorem Explained with Example
00:13:52
Transition Diagram to Regular Expression | Arden’s Theorem Explained with Example

219 views

4 months ago

Regular Expression to NFA to Minimized DFA | Strings Ending with 00
00:16:10
Regular Expression to NFA to Minimized DFA | Strings Ending with 00

270 views

4 months ago

Function Point Numerical Example - 1 | Software Engineering
00:12:09
Function Point Numerical Example - 1 | Software Engineering

686 views

4 months ago

Introduction to DFA | Mathematical Definition & 3 Basic Examples
00:17:02
Introduction to DFA | Mathematical Definition & 3 Basic Examples

142 views

4 months ago

Moore Machine Example | Output 'a' if Ends with 101, 'b' if Ends with 110, Else 'c' (Alphabet {0,1})
00:17:03
Moore Machine Example | Output 'a' if Ends with 101, 'b' if Ends with 110, Else 'c' (Alphabet {0,1})

763 views

4 months ago

Convert Regular Expression to NFA | Thompson’s Construction Method
00:13:18
Convert Regular Expression to NFA | Thompson’s Construction Method

1,115 views

4 months ago

NFA Example | Strings with 3rd Last Symbol = 1 over Alphabet {0, 1}
00:10:53
NFA Example | Strings with 3rd Last Symbol = 1 over Alphabet {0, 1}

290 views

5 months ago

NFA Example | Strings Ending with "aa" over Alphabet {a, b}
00:05:58
NFA Example | Strings Ending with "aa" over Alphabet {a, b}

314 views

5 months ago

DFA Example | Strings with Even Number of 0s and Odd Number of 1s (Alphabet {0,1})
00:13:43
DFA Example | Strings with Even Number of 0s and Odd Number of 1s (Alphabet {0,1})

319 views

5 months ago

DFA Example | Accept Strings with at Least Three ‘a’s over {a, b}
00:10:36
DFA Example | Accept Strings with at Least Three ‘a’s over {a, b}

345 views

5 months ago

Finite State Machine | Strings with Odd Length Starting with 0 or Even Length Starting with 1
00:11:49
Finite State Machine | Strings with Odd Length Starting with 0 or Even Length Starting with 1

262 views

5 months ago

Finite State Machine | Accept Strings Without '11' as a Substring over input Alphabet = {0,1}
00:08:38
Finite State Machine | Accept Strings Without '11' as a Substring over input Alphabet = {0,1}

182 views

5 months ago

Finite State Machine: Check if a Binary Number is Divisible by 3
00:11:17
Finite State Machine: Check if a Binary Number is Divisible by 3

579 views

5 months ago