Back to the 2023 paper
Similar questions
Formal Language & Automata TheoryBegin with the grammar: S \to ASB / \epsilon A \to aAS / a B \to SbS / A / bb (i) Eliminate \epsilon-productions. (ii) Eliminate unit productions in the resulting grammar. (iii) Eliminate any useless symbol in the resulting grammar. (iv) Put the resulting grammar into CNF.202214mFORMAL LANGUAGE & AUTOMATA THEORYCheck whether the grammar is ambiguous: S \to a \mid abSb \mid aAb A \to bS \mid aAAb20247mFormal Language & Automata TheoryConvert the following context-free grammar into GNF: S \to XY X \to YS \mid b Y \to SX \mid a20197mFORMAL LANGUAGE & AUTOMATA THEORYGiven the grammar: S \to aB \mid ba \\ B \to b \mid bs \mid aBB For the string aaabbabbba find: 1. Leftmost derivation 2. Rightmost derivation 3. Parse tree20237m
PreviousConstruct NFA for the regular expression: (0+1)^*00(0+1)^*NextProve the identity: (1+00^*1) + (1+00^*1)(0+10^*1)^*(0+10^*1) = 0^*1(0+10^*1)^*
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.