Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Finite Automata
Comprehension Passage
A machine is represented by states Q, input alphabet Σ, transition function δ. Initial state qo and final state F. The machine accepts all the strings over Σ = {a,b}, which starts and ended with any combination of all alphabet and abb works/lies in all the strings to be accepted
For the above specified passage, which of the following represent the grammar for the language accepted the machine?
1
S → AabbB, A → aA|∈, B → bB|∈
2
S → abbA, A → aA|∈|bA
3
S → AabbA, A → aA|bA|∈
4
S → Aabb, A → aA|bA|∈