Bijan Krishna Paul : question theory of automata from Mishra CHAPTER 5

Tuesday, February 23, 2021

1. REGULAR EXPRESSIONS

2. IDENTITIES FOR REGULAR EXPRESSIONS

3. NDFAs WITH A-MOVES AND REGULAR EXPRESSIONS

4. Any set L accepted by a finite automaton M is represented by

a regular expression.

5. CONVERSION OF NONDETERMINISTIC SYSTEMS TO

DETERMINISTIC SYSTEMS

6. ALGEBRAIC METHOD USING ARDEN'S THEOREM

7. CONSTRUCTION OF FINITE AUTOMATA EQUIVALENT

TO A REGULAR EXPRESSION.

8. EQUIVALENCE OF Two FINITE AUTOMATA

9. EQUIVALENCE OF Two REGULAR EXPRESSIONS

10. PUMPING LEMMA FOR REGULAR SETS

11. CLOSURE PROPERTIES OF REGULAR SETS

12. REGULAR SETS AND REGULAR GRAMMARS

SEM 1	SEM 2	SEM 3
SEM 4	SEM 5	SEM 6

SEM 1	SEM 2	SEM 3
SEM 4	SEM 5	SEM 6

SEM 1	SEM 2	SEM 3
SEM 4	SEM 5	SEM 6

Bijan Krishna Paul

CU BSC computer science old syllabus	WBSU BSC computer science old syllabus
CU cbcs BSC computer science HONOURS syllabus 2018	WBSU cbcs BSc computer science HONOURS syllabus 2018
CU cbcs BSC computer science GENERAL syllabus 2018	WBSU cbcs BSC computer science GENERAL syllabus 2018