|
Teaching Scheme |
Exam Scheme |
|||||
|
Th. |
Pract. |
Total |
Th. |
Pract. |
TW/Viva |
Total |
|
04 Marks |
02 Marks |
06 Marks |
100 Marks |
25 Marks |
25 Marks |
150 Marks |
|
Hrs./Week |
Hrs./Week |
Hrs./Week |
(3 Hrs.) |
(3 Hrs.) |
(3 Hrs.) |
(3 Hrs.) |
Basic definitions :
Operation on languages : Closure properties of language classes. context free languages : the Chomsky griebach normal forms. linear grammars and regular languages. regular expressions. context sensitive languages : the kuroda normal form, one sided context sensitive grammars.
Unrestricted languages : Normal from and derivation graph. automata and their languages : finite, pushdown, 2-push-down automata and tuning machines. the equivalence of the automata and the appropriate grammars. the deck language.
Syntax analysis : Ambiguity and the formal power series. formal properties of LI (K) and Lr(K) grammars.
Derivation languages : Rewriting systems, algebraic properties, canonical derivations, context sensitivity.
Cellular automata : Formal language aspects, algebraic properties university & complexity variants.
Texts/Reference :
Introduction to formal languages, -By G. E. Reevsz, mc-graw hill.
Formal language theory, -By M. H. Harrison, addision-wesley.
Theory and applications of cellular automata, world scientific. -By S. wolfman,.
