Theory Of Automata

Which one of the following regular expressions correctly represents the language of the finite automaton given below?

Which of the following statements is/are TRUE?

Which one of the following regular expressions represents the set of all binary strings with an odd number of 1's?

Consider the following statements. I. If L1 L2 is regular, then both L1 and L2 must be regular. II. The class of regular languages is closed under infinite union. Which of the above statements is/are TRUE?

Consider the language L = {an | n 0} anbn | n 0} and the following statements. I. L is deterministic context-free II. L is context-free but not deterministic context-free. III. L is not LL(k) for any k. Which of the above statements is/are TRUE?

Consider the following language. L = { x {a,b}* | number of a's in x divisible by 2 but not divisible by 3 } The minimum number of states in DFA that accepts L is _______.