Noted. This paper is in our queue now. Check back tomorrow.
We could not record that here. Email the paper name to hirenjsca@gmail.com and we will add it.
Differentiate between a Deterministic Finite Automaton (DFA) and a Nondeterministic Finite Automaton (NFA).
Construct NFA accepting all string that end in 01 and convert NFA to DFA using the subset construction method.
Define Regular Expressions.List out Applications of Regular Expressions.
Explain the concept of equivalence and minimization of Finite Automata.
Explore the various closure properties of regular languages, including how the union, intersection, and complement of regular languages can be characterized and computed.
Describe the Pumping Lemma for regular languages and its role in determining whether a language is regular. Provide an example of how it can be used to prove non-regularity.
E->E+E | E-E | E* | (E) | idProvide a comprehensive overview of context-free grammars, including their formal definition, notation, and use in specifying languages
Define the terms "generating symbols" and "reachable symbols" in the context of context-free grammars.
Discuss the differences between Backus-Naur Form (BNF) and Chomsky Normal Form (CNF) in the representation of context-free grammars.
S → aB / bAS → aS / bAA / aB → bS / aBB / bGive leftmost and rightmost derivations of string w = aaabbabbba.Alsodraw the parse tree corresponding to this string.Define the term "deterministic Pushdown Automaton" (DPDA) and discuss the differences between DPDAs and non-deterministic PDAs (NPDAs).
Define Push Down Automata. List out the operations performed on Push Down Automata (PDA). Construct the PDA over alphabet Σ={0,1} for the Language L= {0n1n |n>=0}. Justify your answer.
Explain the intersection and complement operations on Context-Free Languages (CFLs) and why these operations are valuable for language manipulation.
Discuss the equivalence between Pushdown Automata (PDAs) and Context-Free Grammars (CFGs).
Define Post's Correspondence Problem and provide its formal formulation.
Explain the concept of primitive recursive functions and their role in computability theory. Provide a basic example
Provide an overview of the Turing Machine and its fundamental components, such as the tape, head, states, and transition functions.
Define partial functions and total functions in the context of computable functions.
Questions repeat across sessions. Working through two or three papers shows you which topics GTU asks most.
BE IT
Send this paper to your class group. Every question has its own link.
Official Gujarat Technological University (GTU) examination paper for Formal Language and Automata Theory (Summer 2024, B.E. · IT Engineering, Sem 5). Features complete 70-mark regular & remedial examination pattern, official marking distribution across all 5 questions, and direct 1-click official PDF download.
Transcribed for student exam preparation from Gujarat Technological University official examination archives. Questions, syllabus guidelines, and curriculum marking schemes remain the intellectual property of Gujarat Technological University.
3151605 Formal Language and Automata Theory
Official GTU PDF · Summer 2024
The PDF could not be loaded from the university's website.
Open the PDF directly