CMRTC College Data Share

Skip to content
Jump to main navigation and login

Nav view search

Navigation

Search

You are here: Home

Computer Science & IT

Theory of Automata, Formal Languages and Computation

Theory of Automata, Formal Languages and Computation

01 GRAMMARS AND NATURAL LANGUAGE PROCESSING

02 GRAMMARS AND LANGUAGES GENERATED

03 GRAMMARS AND LANGUAGES GENERATED (Contd)

04 AMBIGUITY IN CFG

05 AMBIGUITY IN CFG

06 REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL FORM FOR CFG

07 GREIBACH NORMAL FORM FOR CFG

08 FINAL STATE AUTOMATA

09 NON DETERMINISTIC FSA

10 NON DETERMINISTIC FSA (Contd)

11 NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES

12 EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARS

13 REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO NFSA

14 DFSA TO REGULAR EXPRESSIONS

15 PROBLEMS AND SOLUTIONS-I

16 PUMPING LEMMAS FOR REGULAR SETS AND CFL

17 MYHILL - NERODE THEOREM

18 MINIMIZATION OF DFSA

19 FSA WITH OUTPUT MOORE AND MEALY MACHINES

20 PUSHDOWN AUTOMATA

21 PUSHDOWN AUTOMATA , EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE AND ACCEPTANCE BY FINAL STATE

22 PUSHDOWN AUTOMATA CFG TO PDA

23 PUSHDOWN AUTOMATA PDA TO CFG

24 PROBLEMS AND SOLUTIONS-II

25 PROBLEMS AND SOLUTIONS - III

26 TURING MACHINES

27 TURING MACHINES (Contd)

28 TURING MACHINE AS ACCEPTOR , TECHNIQUES FOR TM CONSTRUCTION

29 GENERALIZED VERSIONS OF TURING MACHINES

30 TURING MACHINE AS A GENERATING DEVICE

31 RECURSIVE SETS , RECURSIVELY INNUMERABLE SETS , ENCODING OF TM , HALTING PROBLEM

32 PROBLEMS AND INSTANCES , UNIVERSAL TM , DECIDABILITY

33 RICE'S THEOREM , LINEAR BOUNDED AUTOMATA , PROPERTIES OF TM

34 POST'S CORRESPONDENCE PROBLEMS

35 POST'S CORRESPONDENCE PROBLEMS (Contd), TIME AND TAPE COMPLEXITY OT TM

36 NP - COMPLETE PROBLEMS , COOK'S THEOREM

37 NP - COMPLETE PROBLEMS (Contd)

38 REGULATED REWRITING

40 GRAMMAR SYSTEMS

41 DNA COMPUTING

42 MEMBRANE COMPUTING

Powered by Phoca Download