EE-Learning
NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES
Catogry:
Computing
Subject:
Computer Science
Course:
Theory Of Automata, Formal Languages And Computation
Lecture List
MEMBRANE COMPUTING
DNA COMPUTING
GRAMMAR SYSTEMS
L – SYSTEMS
REGULATED REWRITING
NP – COMPLETE PROBLEMS I
NP – COMPLETE PROBLEMS , COOK’S THEOREM
POST’S CORRESPONDENCE PROBLEMS (Contd) TIME AND TAPE COMPLEXITY OT TM I
POST’S CORRESPONDENCE PROBLEMS
RICE’S THEOREM,LINEAR BOUNDED AUTOMATA,PROPERTIES OF TM
PROBLEMS AND INSTANCES , UNIVERSAL TM , DECIDABILITY
RECURSIVE SETS , RECURSIVELY INNUMERABLE SETS , ENCODING OF TM , HALTING PROBLEM
TURING MACHINE AS A GENERATING DEVICE III
GENERALIZED VERSIONS OF TURING MACHINES
TURING MACHINE AS ACCEPTOR , TECHNIQUES FOR TM CONSTRUCTION II
TURING MACHINES I
TURING MACHINES
PROBLEMS AND SOLUTIONS – I
PROBLEMS AND SOLUTIONS
PUSHDOWN AUTOMATA PDA TO CFG III
PUSHDOWN AUTOMATA CFG TO PDA II
PUSHDOWN AUTOMATA,EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE I
PUSHDOWN AUTOMATA
FSA WITH OUTPUT MOORE AND MEALY MACHINES
MINIMIZATION OF DFSA
MYHILL-NERODE THEOREM
PUMPING LEMMAS FOR REGULAR SETS AND CFL
PROBLEMS AND SOLUTIONS
DFSA TO REGULAR EXPRESSIONS
REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO NFSA
EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARS
NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES
NON DETERMINISTIC FSA I
NON-DETERMINISTIC FSA
FINAL STATE AUTOMATA
GREIBACH NORMAL FORM FOR CFG
REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL FORM FOR CFG
SIMPLICATION OF CFG
AMBIGUITY IN CFG
GRAMMARS AND LANGUAGES GENERATED II
GRAMMARS AND LANGUAGES GENERATED I
GRAMMARS AND NATURAL LANGUAGE PROCESSING