Back to the 2025 paper
Similar questions
Formal Language & Automata TheoryDesign a Turing Machine that accepts the language L = \{a^{n}b^{n} \mid n \ge 0\}. Show the transition diagram/table and trace for input aabb.20257mFormal Language & Automata TheoryExplain Linear Bounded Automata and its relationship with Context-Sensitive Languages.20257mFormal 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^*ab20192mFormal Language & Automata TheoryDesign deterministic finite automata for the set of strings over the alphabet \{a, b\} containing at least three occurrences of three consecutive b's, overlapping permitted (e.g., the string bbbbb should be accepted).20197m
PreviousGiven the following context-sensitive grammar: S \rightarrow aSBC | abc CB \rightarrow BC aB \rightarrow ab bB \rightarrow bb bC \rightarrow bc cC \rightarrow cc Identify the language generated by the grammar. Derive the string aabbcc step by step.NextDesign a Turing Machine that enumerates all strings over {a, b} in lexicographic order. Explain the working of the machine.
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.