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

Formal language and automata theory

Previous year question paper with solutions for Formal language and automata theory from 2006 to 2016

Our website provides solved previous year question paper for Formal language and automata theory from 2006 to 2016. Doing preparation from the previous year question paper helps you to get good marks in exams. From our FLAT question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.

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 %] 

2016
Download
2015
Download
2014
Download
Download
2013
Download
2012
Download
Download
2011
Download
2010
Download
Download
2009
Download
Download
2008
Download
Download
2007
Download
Download
2006
Download
Download