Previous year question paper for FLAT (B-TECH computer science engineering 7-8th)

Basic Definitions Operations on Languages: Closure properties of Language Classes.

Context Free languages: The Chomsky Griebach Normal Forms. Linear Grammars and

regular Languages. Regular Expressions Context Sensitive Language; The Kuroda

Normal Form, One sided Context Sensitive Grammars. [35 %]

Unrestricted Languages: Normal form and Derivation Graph, Automata and their

Languages: Finite Pushdown 2-push down Automata and Turing Machines. The

Equivalence of the Automata and the appropriate grammars. The Dyck Language. [25 %]

Syntax Analysis : Ambiguity and the formal power Series, Formal Properties of LL(k)

and LR(k) Grammars. [15 %]

Derivation Languages; Rewriting Systems, Algebraic properties, Canonical Derivations,

Context Sensitivity.[ 15 %]

Cellular Automata : Formal Language aspects, Algebraic Properties Universality &

Complexity Variants. [10 %]