Question 1
In each case, say whether the indicated function is one-to-one and onto.
Derive the string a + (a * a) / a – a using leftmost derivation and rightmost derivation forfollowing grammar.G : S → S + S | S – S | S * S | S/S | ( S ) | aIn each case, say whether the indicated function is one-to-one and onto.
Derive the string a + (a * a) / a – a using leftmost derivation and rightmost derivation forfollowing grammar.G : S → S + S | S – S | S * S | S/S | ( S ) | aLet M1 and M3 be the FAs shown in below figure, recognizing languages L1 and L3 respectively. Draw FAs recognizing the language L1 ∩ L3.

Check whether the grammar is ambiguous or not ?
Given the context-free grammar G, find a CFG G’ in Chomsky Normal Form.G : S → aAa | bBb | ^A → aBb | bBaB → aB | bB | ^S → XaY | YbXX → YY | aY | bY → b | bbDesign a Turing Machine that accepts the language of all strings which contain aba as substring. Trace on input string ababab.
Circulate this solved paper with KaTeX formulas and 1-click AI step solvers to your batchmates on WhatsApp or Telegram.
Official Gujarat Technological University (GTU) examination paper and step-by-step solutions for Theory of Computation (TOC) (Summer 2026, B.E. · Computer Engineering, Sem 6). Features complete 70-mark regular & remedial examination pattern, official marking distribution across all 5 questions, and direct 1-click official PDF download.
Transcribed for student exam preparation from Gujarat Technological University official examination archives. Questions, syllabus guidelines, and curriculum marking schemes remain the intellectual property of Gujarat Technological University.