Information Technology Engineering Sem 4 Automata Theory Question Paper PDF 2026 - Mumbai University | munotes
Loading PDF...
Questions asked in this paper
-
Q1 Attempt any three out of the remaining five questions Assumptions made should be clearly stated Draw suitable diagram where ever necessary
-
Q1 Attempt any four sub-questions. Marks
- a. Describe Moore machine with all tuples in detail. 5M
- b. Arrange a mealy machine to accept all strings ending with 00 or 11. 5M
- c. Design DFA to accept strings over the alphabet = {a,b} containing even number of a's. 5M
- d. Evaluate given context-free grammar and Identify whether it is ambiguous or not. 5M
- e. Draw diagram for Chomsky hierarchy and Show all the types with proper explanation. 5M
- a. Design NFA for accepting input strings that contain either the keyword 000 or the keyword 10M 010 and convert it into an equivalent DFA
- b. Design a DFA corresponding to regular expression 10M
- a. Design a Mealy machine that accepts strings ending in “OO” and “11”. Convert the same 10M to Moore Machine
- b. CFG, obtain CFG for the following grammar 10M
- a. Design a Moore machine which counts the occurrence of substring bba in input string. 10M
- b. Design a TM accepting the set of strings with equal number of 0’s and 1’s over {0,1}* 10M
- a. Write Short note on: Halting Problem in TM. 10M
- b. applications of FM, PDA and Turing Machine with example. 10M
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.