Question 11 Consider the following deterministic finite automaton (DFA). The number of strings of length 8 accepted by the above automaton is __________. A 256 Theory-of-ComputationDFAGATE […]
Question 6 Let L1be a regular language and L2be a context-free language. Which of the following languages is/are context free A B C D Theory-of-ComputationContext-Free-LanguageGATE 2021 […]