Theory Of Automata Formal Languages (KCA-201) - AKTU Question Paper 2022-23
MCA · Semester 2 · Free PDF Download
This is the official AKTU Theory Of Automata Formal Languages Previous Year Question Paper for MCA Semester 2, academic session 2022-23. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Course:MCA
Semester:Semester 2
Session:2022-23
University:AKTU / UPTU
Rate this paper
Questions Asked in 2022-23
Theory Of Automata Formal Languages (KCA-201) — extracted question text
Section BAttempt any one
- cWhat do you mean by left linear and right linear gr ammar? Write down the grammar for given DFA
- dDesign a PDA that will accepts all even length pali ndromes over the input symbols {a,b}*. Also justify your transition diagra m for the string w=“abbaaaabba”
- eDefine Post's Correspondence Problem (PCP) and Modi fied PCP with itsapplications. Find a PCP so
- aDefine Deterministic Finite Automata (DFA). Mathema tically represent a DFA that will accept all strings
- bWhat do you understand by minimum state automat state automation for the given transition diagram
- aWhat do you mean by Regular Languages? Discuss the closure properties of Regular Languages
- bState Arden Theorem . Find out the regular expression for the given tra nsition diagram. What do you mean by left linear and right linear gr ammar? Write down the grammar for given DFA. Design a PDA that will accepts all even length pali ndromes over the input symbols {a,b}*. Also justify your transition diagra m for the string Define Post's Correspondence Problem (PCP) and Modi fied PCP with itsapplications. Find a PCP so lutions of the lists x=(b,bab 3,ba) andy=(b 3,ba,a)
Section CAttempt any one part of the following: 10x1=10
- bWhat do you mean by Chomsky Normal form (CNF)? Afte r simplification convert the given productions ofCFG into CNF. S → ABA
- aWhat do you mean by Push Down Automata (PDA)? Discuss deterministic PDA with suitable example
- bUsing two stacks construct a PDA that will accept t he Languages =
- bWrite short note on following: (i) Variants of Turing Machines (ii) Church’s Thesis
Question text is extracted from the official AKTU question paper PDF above. Check the original PDF for equations, diagrams and complete wording. Extracted: 2026-08-23.
Theory Of Automata Formal Languages — Other Year Papers
AKTU Theory Of Automata Formal Languages PYQs from other sessions
More MCA Semester 2 (2022-23) Papers
Other subjects from same semester and session
Cyber Security2022-23Data Structures Analysis Of Algorithms2022-23Database Management Systems2022-23Object Oriented Programming2022-23Operating Systems2022-23
View all MCA Semester 2 2022-23 papers →