Back to the 2025 paper
Similar questions
Formal Language & Automata TheoryConstruct finite automaton corresponding to the regular expression: (a+b)^* c d^* e20207mFormal Language & Automata TheoryConsider the following finite state automaton:  The language accepted by this automaton is given by the regular expression (i) b^*ab^*ab^*ab (ii) (a+b)^* (iii) b^*a(a+b)^* (iv) b^*ab^*ab20192m Compiler DesignConstruct a DFA for the regular expression r = 0^*1^*2^*.20257mFormal Language & Automata TheoryConvert the regular expression (a + b)abb(a + b) into an equivalent DFA. Show all steps.20257m
PreviousDesign a single-tape Turing Machine that multiplies two unary numbers, where the input is of the form 1^m 0 1^n and the output is 1^{m \times n}. Clearly define the input alphabet, tape alphabet, and halting condition. Simulate the working of the Turing Machine on the input string 1101.NextWrite a short note on Rice's Theorem with an application.
AI LearningWeb Platform
Coursify — Personal AI Course Generator
Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.