Information Technology Engineering Sem 4 Automata Theory Question Paper PDF 2026 - Mumbai University | munotes
Loading PDF...
Questions asked in this paper
-
Q3 Which of the following is a regular expression for binary strings with no Given DFA is for binary numbers divisible 2 Given DFA is for binary numbers divisible 3 Given DFA is for binary numbers divisible 4 Given DFA is for every 0 followed by 1 Given DFA is for strings with the same first and last symbol Given NFA is for strings with the same first and last symbol Given NFA is for strings for searching the keyword “aba” or Given NFA is for strings with any combination of a’s and b’s The regular expression for above grammar is (1 + 01)*00(A + 0) The regular expression for above grammar is (1 + 01)*00(1 + 10) The regular expression for above grammar is (1 + 01)*)000(1 + 10) The regular expression for above grammar is (0 + 01)*0(1 + 01)
-
Q7 The grammar for the language where a’s followed by twice as many b’s, i.e, What is the language of Finite Automata ? The a programmable machine that can compute anything that is computable Which of the following relates to the Chomsky hierarchy? Solve any Four questions out of Six. 5 marks each A Convert given NFA to DFA Construct only a Mealy machine for the following: For input from, where (0,1), if the input ends in ‘101’, the output should be ‘x’; if the input ends in ‘110’, output should be ‘y’ otherwise output should be ‘z’. (transition table and diagram both are expected) C Give Regular Expressions for
- i) For all strings over 0,1 that starts with 10 and ends with 01
- ii) For all strings over a,b which contains exactly 3 occurrence of ‘ b’ over Consider the following CFG: G = { (S, A), (a, b), P, S}, where P consists of : Derive the string ‘aabbaa’ using leftmost derivation and rightmost derivation Compare and Contrast between FA, PDA and TM F what is Ambiguous Grammar, find if the following grammar is ambiguous or not A What are steps for converting CFG to CNF ? Convert the given grammar G to addition of two unary numbers. (transition table and diagram both are expected) more number of 1’s followed by zero or more number of 2’s . convert this to DFA
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.