TAFL Unit 2 Handwritten Notes AKTU (BCS402)

AKTU · BTECH · Semester 4 · Theory of Automata and Formal Languages · Unit 2 · Handwritten Notes

AKTU Theory of Automata and Formal Languages (BCS402) Unit 2 handwritten notes for B.Tech Semester 4 – Regular Expressions and Languages. Topics: Regular…

Open the interactive reader to study this resource on AcademicArk.

Unit 2: Regular Expressions and Languages – AKTU syllabus topics

  • Regular Expressions: Transition Graph, Kleene's Theorem
  • Arden's Theorem: FA to Regular Expression Conversion, Algebraic Method Using Arden's Theorem
  • Closure Properties of Regular Languages
  • Pumping Lemma for Regular Languages: Pigeonhole Principle, Application of Pumping Lemma
  • Decidability of Regular Languages: Decision Properties

Most asked AKTU PYQ questions from Unit 2

  1. Q4a. Using Pumping Lemma, show that the language L = {aⁿbⁿcⁿ | n ≥ 0} is not regular. (7 marks, 2024-25)
  2. Q2b. Prove using Arden's Theorem the regular expression for the following transition diagram: States: A (start), B (final). Transitions: A --a--> A, A --b--> B, B --a--> B (7 marks, 2024-25)
  3. Q4b. Discuss closure properties (i.e. union, concatenation, complement, intersection and difference) of regular language. (7 marks, 2023-24)
  4. Q5b. Explain Closure properties of regular language. (10 marks, 2022-23)
  5. Q2b. Compute the regular expression using Arden's Theorem for the following DFA. (7 marks, 2023-24)
  6. Q4a. State Pumping Lemma for Regular Language. Show that the given language L={ap | Where p is a prime} is not regular. (7 marks, 2023-24)
  7. Q4a. Find the regular expression corresponding to the finite automata given below: (10 marks, 2022-23)
  8. Q4b. State pumping lemma for regular language. Prove that the language L= {a^p | p is prime} is not regular. (10 marks, 2022-23)
  9. Q2b. Prove that the Compliment, Homomorphism, Inverse Homomorphism, and Closure of a Regular Language is also Regular. (10 marks, 2021-22)
  10. Q3b. Explain in detail about the Pumping Lemma and application of Pumping Lemma for Regular Languages. (10 marks, 2021-22)

AKTU paper codes: BCS402, KCS402, RCS403

Other Theory of Automata and Formal Languages units

Theory of Automata and Formal Languages previous year papers

Browse all notes · Semester 4 notes