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