A machine is represented by states Q, input alphabet Σ, transition function δ,…

PYQ UGC NET 2024

A machine is represented by states Q, input alphabet Σ, transition function δ, initial state q₀ and final state F. The machine accepts all the strings over Σ = {a, b}, which start and ended with any combination of all alphabet and abb works/lies as substring in all the strings to be accepted.
For the above mentioned passage which of the following is correct?

Attempted by 222 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…