March 20, 2025
Question 30 The language L = {0i21i | i≥0} over the alphabet {0, 1, 2} is: A not recursive. B is recursive and is a deterministic CFL. […]
March 25, 2025
Question 8 If the state machine described in figure, should have a stable state, the restriction on the inputs is given by A B C D […]
March 25, 2025
Question 90 Arrange the following Language Classes in order according to their expressive power, as defined by Chomsky hierarchy : (A) Context-free languages (B) Contex t-sensitive […]
April 1, 2025
Question 31 What can be said about a regular language L over {a} whose minimal finite state automation has two states? A L must be {an […]