16 подписчиков
32 видео
LEC1 FLAT Introduction
LEC4 CONVERSION OF INFIX EXPRESSION TO POSTFIX EXPRESSION
CIRCULAR QUEUE USING LINKED LIST
LEC9 Contd , design DFA ends with a
LEC15 Conversion NFA Epsilon to NFA
CIRCULAR QUEUE USING ARRAYS
LEC18 Finite Automata with output Moore and Melay machines
LEC17 Minimization of Finite Automata
LEC2 Applications of FLAT
LEC1 STACK INTRODUCTION
LEC12 Equivalence of NFA and DFA
LEC13 Applications of Finite Automata
LEC20 Conversion of Melay to Moore Machine
DEQUE USING LINKED LIST
LEC19 Conversion of Moore to Melay Machine
LEC10 NFA
LEC3 STACK USING LINKED LIST
L1 INTRODUCTION TO LINUX PROGRAMMING
QUEUE USING ARRAYS
LEC2 STACK USING ARRAYS
LEC9 Design DFA containing a
LEC11 Design NFA starts with a
LEC5 EVALUATION OF POSTFIX EXPRESSION
QUEUE USING LINKED LIST
LEC14 NFA with epsilon
LEC16 Cont , Conversion NFA to DFA
