Skip to content
InsemAug 20252019 patternTE Comp

Theory of Computation (TOC) SPPU Insem Question Paper Aug 2025

All 4 questions from this SPPU insem paper, as printed. Read them here or open the PDF.

Open the PDF
Subject code
310242
Pattern
2019 pattern
Exam
Insem
Session
Aug 2025
Max. marks
30
Time
1 Hour
Semester
I
Paper code
[6579]-326

Printed for: T.E. (Computer Engineering)/(Computer Science) (Insem)

Instructions to the candidates

  1. Attempt Q.1 or Q.2, Q.3 or Q.4.
  2. Neat diagram must be drawn wherever necessary.
  3. Assume suitable data if necessary.

Questions

  1. Q1

    1. a)

      This part has equations that don’t show as text. Open the PDF to read it.

      [8]
    2. b)

      Consider the following Mealy Machine of Construct equivalent Moore machine. Also differentiate between Moore and Mealy machine (any 4 points).

      [7]

  2. Q2

    1. a)

      Design Moore machine such that for every substring that ends in bab the machine will give output 1 over alphabet  Further convert the same Moore machine into Mealy machine.

      [8]
    2. b)

      Design a DFA which can accept a binary number divisible by 3. Explain the logic also. 2

      Also asked:Oct 2024

      [7]

  3. Q3

    1. a)

      Write a regular expression to accept following language over alphabet {a,b} * i) Strings having at least one occurrence of substring ‘aaa’. ii) Strings starting and ending with same symbol. iii) Strings having even number of a’ s.

      [6]
    2. b)

      Using Arden’s theorem, find regular expression.

      [5]
    3. c)

      This part has equations that don’t show as text. Open the PDF to read it.

      [4]

  4. Q4

    1. a)

      This part has equations that don’t show as text. Open the PDF to read it.

      [6]
    2. b)

      This part has equations that don’t show as text. Open the PDF to read it.

      [5]
    3. c)

      This part has equations that don’t show as text. Open the PDF to read it.

      [4]