Question Papers
formal language and automata theory
Previous year question paper with solutions for Formal language and automata theory from 2006 to 2016
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 %]
Contribute to Our Library
Help us expand our collection by uploading your question papers.
Upload PDFs or images; our team will review and publish them.