Finite Automaton (FA) has: A.Zero or more final states B. Exactly one final state C. Not more than two final states D. Exactly two final states The formal language is also known as _________. A. Semantic language B. Informal language C. Syntactic language D. Normal language The language of all strings defined over alphabet set = {x, y} having triple x’s or triple y’s will have the minimum strings with length of: A. 1 B. 3 C. 4 D. 2 If an alphabet has "2" number of letters, then total number of strings of length "3" will be ________. A. 5 B. 9 C. 8 D. 6 GTG for the expression (a+b)*bb may have minimum number of states: A. 3 B. 4 C. 2 D. 1 Consider the Regular Expression (RE) a (a + b)b*. Which one of the following is NOT accepted by the provided RE? A. aa B. aab C. aba D. abb Which of the following is NOT true about the term alphabet? A.It is usually denoted by Greek letter sigma B. It can