**Review of mathematical preliminaries:**

**set,**

**relation and functions,**

**graphs and trees,**

**string,**

**alphabets and languages,**

**principle of induction,**

**predicates and propositional calculus.**

**Theory of automata:**

**defination,**

**description,**

**DFA,**

**NFA,**

**transition systems,**

**2DFA,**

**equivalence of DFA & NDFA,**

**regular expressions,**

**regular grammer,**

**fsm with output ( mealy and moore models),**

**minimisation of finite automata.**

**Formal Languages:**

**Defination & description,**

**pharse structured grammars & their classification,**

**chomskey classification of languages,**

**closure properties of families of language,**

**regular grammer,**

**regular set & their closure properties,**

**finite automata,**

**equivalence of FA and regular grammer,**

**regular set & their closure properties finite automata,**

**equivalence of fa and regular expression ,**

**equivalence of two way finite automata,**

**equivalence of regular expressions.**

**Context-free grammer & pda:**

**properties unrestricted grammer & their equivalence,**

**derivation tree simplifying CFG,**

**unambiguifying CFG,**

**Productions,**

**normal form for CFG,**

**pushdown automata,**

**2 way PDA,**

**relation of PDA with CFG,**

**determinism & non determinism in PDA & related theorems,**

**parsing and pushdown automata.**

**turing machine:**

**model,**

**design,**

**representation of TM,**

**language accepted by TM,**

**universal turing machine,**

**determine & non-determinism in TM,**

**TM as acceptor/generator/algorithms,**

**multidimentional,**

**multitracks,**

**multitape,**

**two way infinite tape,**

**multihead,**

**halting problems of TM.**

**Computability:**

**concepts,**

**introduction to complexity theory,**

**introduction to undecidaibility,**

**recursively enumerable sets,**

**primitive recursive functions,**

**recursive set,**

**partial recursive sets,**

**concepts of linear bounded automata,**

**scontext sensitive grammers & their equivalence**

**MONIKA YADAV (MCA),**

Software Engineer,

AeroSoft Corp., Indore

**ROHIT KESHRIYA (MCA),**

Software Engineer,

AeroSoft Corp., Indore

For guest faculty Contact us on following E-mail ID:

monikay.aerosoft@gmail.com

monikay.aerosoft@rediffmail.com

monikay.aerosoft@yahoo.com

monikay.aerosoft@hotmail.com

rohit.aerosoft@gmail.com

rohit.aerosoft@rediffmail.com

rohit.aerosoft@yahoo.com

rohit.aerosoft@hotmail.com

Note: We have been used search engines for gathering content.

## No comments:

## Post a Comment