Information Technology Engineering Sem 4 Automata Theory Question Paper PDF 2026 - Mumbai University | munotes
Loading PDF...
Questions asked in this paper
-
Q1 Question No.1 is compulsory
-
Q2 Attempt any three question form reaming question
- a) Construct NFA for accepting binary string in which the first part of each string contain at least four 0’s and second part contains at least (05)
- b) State and explain limitations and power of Finite Automata. 5
- c) Design a Moore machine for binary number divisible by 3 5
- d) Construct a FA to search the keyword 101 for String over {0,1}. 5
-
Q2 a) Convert the following grammar to CNF 10 marks
- b) Design a Moore machine that will read sequences made up of letters ,U and will give an output having the same sequences. Except that in those cases where and directly follows and ‘E’, it will be changed to (10)
- a) Minimize the following DFA
- b) Convert the following NFA to DFA( final state is marked with *) 10
- a) Design PDA for recognizing L= {a" } 10
- b) Using pumping lemma prove that the languages of all even palindromes over an alphabet {a,b} is non regular (10)
-
Q6 Write a Short Note on (any four) 20 marks
- a) Chomsky Hierarchy
- b) Applications of Automata theory
- c) Pumping Lemma for regular languages
- d) Simplification of CFG
- e) Variation of Tuning Machine
Read from the scan above, so a character or two may differ. The scan is the original.
Something wrong on this page? Report it and we will check it against the scan.
Information Technology Engineering Sem 4 Paper Path
Use this paper as one timed INFT mock, then compare Operating System, Automata Theory, Engineering Mathematics IV, and Computer Organization papers from nearby Mumbai University year sets.
Step: Open this Information Technology Engineering paper in the free viewer first.
Step: Compare the year set and nearby INFT subjects for repeated paper patterns.
Step: Use notes only for topics where marks were missed during practice.
Quick Help
Related Resources
Something wrong with this paper? Report it.