Канал: Sudhakar Atchala - Смотреть видео c канала или скачать видео c канала в MP4, музыку MP3 на телефон или компьютер.

$Construct PDA for the language L={a^2n b^n} || Pushdown Automata || TOC || FLAT || Theory of Comp$

Non homogeneous Recurrence Relation for 'n^2' value || DMS || DMGT || MFCS || Solved Example

Sudhakar Atchala

Sudhakar Atchala

Non homogeneous Recurrence Relation for 'n^2' value || DMS || DMGT || MFCS || Solved Example

Multinomial Theorem | 4 Examples |Find the coefficient of x^3y^3z^2 in the expansion of (2x-3y+5z)^8

Non homogeneous Recurrence Relation for 'n' value || DMS || DMGT || MFCS || 2 Solved Examples

Universal Turing Machine || Binary encoding of Turing machine || TOC || FLAT || Automata Theory

Non homogeneous Recurrence Relations with Constant Coefficients || DMS || DMGT || MFCS

Lattice in Discrete Mathematics | 2 Examples | Lattice Properties | Hasse Diagram is lattice or not

Hasse Diagram (15 Example Problems) || Hasse Diagram || How to Draw Hasse Diagram || DMS || MFCS

Hasse Diagram | How to Draw Hasse Diagram | Hasse Diagram in Discrete Mathematics | Procedure | DMS

Design a Turing Machine to accept Even number of 0's and Any number of 1's || TOC || FLAT ||Automata

Construct Turing machine for language of strings ending with ab || Automata Theory || TOC || FLAT

Subgraphs in Discrete Mathematics || Spanning Subgraphs || Induced Subgraphs || Types of Subgraphs

Design a Turing Machine for Incrementer || Decrementer || function f(x)=x+1 || f(x)=x+2 || f(x)=x-1

Show that ∀x(P(x) v Q(x)) = (∀x) (P(x)) v (Ǝx) ( Q(x)) || Logical Equivalences Involving Predicates

Show that Ǝx(P(x) ʌ Q(x)) = (Ǝx) (P(x)) ʌ (Ǝx) ( Q(x)) | Logical Equivalences Involving Predicates

Planar Graph Examples | K2,3 | K3,3 | K5 | A graph of oder 5 and size 8 | Order 6 & size 12 | DMS

Types of graphs in discrete mathematics | Regular | Cyclic | Complete | Bipartite|Complete Bipartite

Design of PDA for Language L=a^i b^j c^k | j=k || Theory of computation || TOC ||FLAT | PDA Examples

Inference Rules For Predicate Logic | Rules of Inference for Quantified Statements | DMS |3 Examples

Design of PDA for Language L=a^i b^j c^k | i=j || Theory of computation || TOC ||FLAT | PDA Examples

Construct PDA for the language L={a^2n b^n} || Pushdown Automata || TOC || FLAT || Theory of Comp

Negation Of a Quantified Statement in Discrete Mathematics || 3 Examples || Predicate logic

Composite Functions || Function Composition || 4 Examples || DMGT || DMS || MFCS || DM

Quantifiers in Predicate logic || Represent the Sentences(Statements) in Symbolic Form || DMGT ||DMS

[New] Convert Right Linear Grammar to Left Linear Grammar | Construction of Left Linear Grammar

Converting Finite Automata to Regular Grammar || Procedure || Example || Construction of Regular Gr

Converting Regular Grammar to Finite Automata || Procedure || 2 Examples || Construction || TOC

Greibach Normal Form || Converting CFG to GNF || TOC || FLAT || Theory of Computation || Example 3

Greibach Normal Form || Converting CFG to GNF || Ex2 || TOC || FLAT || Theory of Computation

Chomsky Normal Form || Converting CFG to CNF || Ex 2 || TOC || FLAT || Theory of Computation

Removal of Unit Productions || Simplification of CFG || TOC || Theory of Computation || FLAT

Conversion of Finite Automata to Regular Expression using Arden's Theorem | Construct | TOC | FLAT

Conversion of Finite Automata(DFA) to Regular Expression using Arden's Theorem || Construct || TOC

INFERENCE THEORY || VALID CONCLUSION USING TRUTH TABLE || THEORY OF INFERENCE || DMS

COLLAPSING FIND - DISJOINT SET OPERATION || DESIGN AND ANALYSIS OF ALOGORITHMS || DAA

WEIGHTED UNION - DISJOINT SET OPERATION || DESIGN AND ANALYSIS OF ALOGORITHMS || DAA

Minimization of Finite Automata(DFA) using Equivalence or Partition Method || Example 3

Disjoint Set Operations - Simple Union & Find Algorithms || DAA

Minimization of DFA(Finite Automata) using Equivalence or Partition method || Example 2

convert nfa with epsilon to nfa without epsilon || Example 2

DFA which accepts strings starting and ending with same symbol || FLAT || Theory of computation

Logical Equivalence with out using truth table examples or equivalent formulas || DMS || 3 examples

Design DFA that accepts language L={awa | w ∈ {a,b}*} || String starts with 'a' and ends with 'a'

DFA for atmost 2(two) a's || atmost 3(Three) a's || Not more than 2 a's || Not more than 3 a's

DFA of language with all strings starting with 'a' & ending with 'b' || DFA Example

DFA for number of a's are divisibly by 3 || DFA for a's always appears tripled

Reliability Design using Dynamic Programming || DAA || Design and Analysis of Algorithms

Acceptance of a String by a Finite Automata | Language accepted by Finite Automata || Acceptability

Strings in Automata Theory || Central(Basic) Concepts || Mathematical Notations|| String Operations

Language in Automata Theory | Central(Basic) Concepts | Mathematical Notations|Theory of Computation

1 to 8 Demultiplexer | 1 * 8 Demultiplexer | Working | Block Diagram |Truth Table|Boolean expression

Programmable Logic Devices | PLDs | PROM | PAL | PLA | Programmable Read Only Memory | Array Logic

PROM (Programmable Read Only Memory) || Implementing Full Adder using PROM || PROM Example2

PROM (Programmable Read Only Memory) || Implementing Boolean Functions using PROM || PROM Example

Multistage Graph | Backward Approach | Ex2 | Dynamic Programming | Design and Analysis of Algorithms

Multistage Graph | Backward Approach | Ex1 | Dynamic Programming | Design and Analysis of Algorithms

Multistage Graph | Forward Approach | Dynamic Programming | Design and Analysis of Algorithms | Ex 2

Multistage Graph | Forward Approach | Dynamic Programming | Design and Analysis of Algorithms | Ex 1

Strassen's Matrix Multiplication - Concept, Algorithm, Time Complexity || DAA || Divide and Conquer

Implementation of Boolean Function using Multiplexers || 8:1 || 4:1 || Example 2 || Implementing

Implementation of Boolean Function using Multiplexers || 8:1 || 4:1 || implementing boolean function

0/1 Knapsack Problem Using Backtracking || Backtracking Algorithm || DAA

Programmable Array Logic(PAL) in Digital Electronics || DLD | Implement Boolean functions using PAL

Programmable Logic Array (PLA) in Digital Electronics || DLD | Implement Boolean functions using PLA

T to JK Flip Flop Conversion || T Flip Flop to JK Flip Flop Conversion || DLD | Digital logic design

JK Flip Flop to T Flip Flop Conversion || JK to T Flip Flop Conversion || Flip Flop Conversions

D Flip Flop to JK Flip Flop Conversion || D to JK Flip Flop Conversion | DLD | flip Flop Conversion

JK Flip Flop to D Flip Flop Conversion || JK to D Flip Flop Conversion || DLD || DE || Digital Logic

Introduction to Greedy Method || General Method || Control Abstraction || Applications || DAA

Introduction to Divide and Conquer Algorithm | General Method | Control Abstraction |Time Complexity

D Flip Flop to T Flip Flop Conversion || D to T Flip Flop Conversion || DLD || DE || Digital Logic

T Flip Flop to D Flip Flop Conversion || T to D Flip Flop Conversion || DLD || DE || Digital Logic

T Flip Flop to SR Flip Flop Conversion || Converting T to SR Flip Flop || DLD || DE || Digital Logic

SR Flip Flop to T Flip Flop Conversion || SR to T Flip Flop Conversion || DLD || DE || Digital Logic

C Program to Convert Binary Number to Decimal Number || Binary to Decimal Conversion - C Programming

C Program to Convert Decimal Number to Binary Number || Decimal to Binary Conversion - C Programming

C Program to find GCD(HCF) & LCM of Two Numbers || Calculating LCM of 2 numbers using GCD

C Program to find LCM of two numbers using loops || LCM of two numbers in c || without recursion