MCASemester 22022-23Theory Of Automata Formal LanguagesKCA-201

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) — complete question paper

Section BAttempt any one
  • c
    What do you mean by left linear and right linear gr ammar? Write down the grammar for given DFA
  • d
    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 w=“abbaaaabba”
  • e
    Define Post's Correspondence Problem (PCP) and Modi fied PCP with itsapplications. Find a PCP so
  • a
    Define Deterministic Finite Automata (DFA). Mathema tically represent a DFA that will accept all strings
  • b
    What do you understand by minimum state automat state automation for the given transition diagram
  • a
    What do you mean by Regular Languages? Discuss the closure properties of Regular Languages
  • b
    State 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
  • b
    What do you mean by Chomsky Normal form (CNF)? Afte r simplification convert the given productions ofCFG into CNF. S → ABA
  • a
    What do you mean by Push Down Automata (PDA)? Discuss deterministic PDA with suitable example
  • b
    Using two stacks construct a PDA that will accept t he Languages  =
  • b
    Write 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. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.

Repeated Questions — KCA-201

Questions that appeared in more than one session, found by comparing 4 years of Theory Of Automata Formal Languages papers (2021-22, 2022-23, 2023-24, 2024-25)

2x

Write short note on following: (i) Variants of Turing Machines (ii) Church’s Thesis

Appeared in: 2021-22 · 2022-23

Theory Of Automata Formal Languages — Other Year Papers

AKTU Theory Of Automata Formal Languages PYQs from other sessions