Gate Material Placement Ready Login Sign up Login Sign up

GATE CSE - Important Keywords

Mathematical Notation
Finite State systems
Finite Automaton
DFA
NDFA
Finite Automation
Regular Languages
Regular Expression
Equivalence of NFA and DFA
Equivalence of NDFA s
finite Automaton
Equivalence of finite Automaton
regular expressions
DFA
Minimization of DFA
Lemma
Pumping Lemma
Regular sets
Grammar Introduction
Grammar Types
Free Grammars context
Free Grammars Languages
Ambiguity
derivation
derivation trees
CFG
Simplification of CFG
Useless symbols
Useless symbols Eliminations
Unit productions
Null productions
Greiback
Normal form
Greiback Normal form
form
Chomsky
Chomsky normal form
CNF
GNF
Automata
Pushdown Automata
Instantaneous descriptions
pushdown
Deterministic pushdown
automata
Pushdown automata
Equivalence of Pushdown automata
CFL
pumping lemma for CFL
pumping Lemma
Turing machines
Computable languages
Turing machine construction
Multi head tape
Turing Machines
Halting problem
Partial Solvability
Chomskian hierarchy
Chomskian hierarchy of languages
Unsolvable Problems
Computable Functions
Primitive function
recursive functions
Recursive
enumerable languages
recursively enumerable languages
Universal Turing machine
CLASSIFYING COMPLEXITY
Tractable problems
Intractable problems
Tractable
intractable problems
NP completeness
Polynomial
time reductions
Any Queries, please contact us @ 09677117110 or mail to NPTEL.Bodhbridge@btechguru.com
Distributed under Creative Commons Attribution-Share Alike - CC BY-SA.
Back to top
View Cart & Pay (0)