CS402 Grand Quiz SOlution Mega Files

(aa + bb + (ab + ba)(aa + bb)(ab + ba)) is the RE of ____. The minimum length of the strings(except null string) of a language that starts and ends in different letters will be: Let FA1 accepts many strings and FA2 accepts none then FA1+FA2 will be equal to: Which of the following machine has only one initial state and no final state? Choose the correct word produced by RE (a + b)*ab. In concatenation, we include the initial state of FA2 automatically after the final state of FA1 because of: Keeping in view the discussion by Martin, how many states are required to recognize the language of all strings defined over ∑= {a,b}, with ‘a’ being the third letter from right? Which of the following diagram is very rigid in order to express any language? If we have only one state, having no transition for input letters, then it is an example of: An _____ can be considered to be an intermediate structure between Finite automaton and Transition Graph. Two FAs are said to be equivalent, if they ______. Let L be the language of all strings, defined over Σ = {0,1}, ending in 10. Which of the following strings are indistinguishable with respect to L with z being 0? In regular expressions, the operator ‘*’ stands for Kleene’s Theorem Part III expresses the relationship between _____. FA of EVEN language shows null string when _____. For every three regular expressions R, S, and T, the languages denoted by R(S U T) and (RS) U (RT) are the __ . Alphabet S = {a, bc, cc} has ___ number of letters. Moore Machine is an application of: Which of the following does not contribute while finding out the length of strings? Which of the following statements is true about NFA with Null String? Which of the following statement is NOT true about TG? An FA is a collection of: Which one of the following RE describes the language of strings having exactly double a, defined over #VALUE! Which of the following is the bypass and state elimination step in the context of Kleene’s theorem part II proof? Which one of the following is a correct word produced by the RE (a*b*)ab? The language of all strings defined over alphabet set = {a, b} containing ‘bbb’ will have the minimum string with length of: Keeping in view the language of all strings ending with ‘a’, for which symbol we will take a loop on the final state of its transition diagram? If we have input 110010111 and the machine generates the 001101000 as an output, then that machine will be called? In the context of make NFA for the concatenation of FA1 and FA2 (FA1 accepting null string), which of the following option is correct? While finding RE corresponding to a TG, we connect the new start state with the old start state by ____ transition. 2nd Quiz Let FA1 accepts many strings and FA2 accepts none then FA1+FA2 will be equal to: In Moore machine is of length n then the output string length will be If r1 and r2 are regular expressions then (r1 * r2) is a / an _____ . Consider the following RE: #VALUE! ted except ______. For every three regular expressions R, S, and T, the languages denoted by R(S U T) and (RS) U (RT) are the __ . How many states of a finite automaton will be final for accepting L = {^, b, bb, bbb}? In case of finite automaton there ___ be a transition on each ____ for every letter of the alphabet set. The language having even number of a’s and even number of b’s defined over S = {a, b} is called _____. (aa + bb + (ab + ba)(aa + bb)(ab + ba)) is the RE of ____. Closure of an FA is the same as _____ of an FA with itself except that the initial state of the required FA is a final state as well. Closure of an FA is the same as _____ of an FA with itself except that the initial state of the required FA is a final state as well. If an FA has 3 states and 2 letters in the alphabet, then it will have _____ number of transitions. There ___ be dead states in NFA. The language of all strings defined over alphabet set = {a, b} containing ‘bbb’ will have the minimum string with length of: If L is a regular language, then (L’)’ U L will be: We can create an equivalent __ for a language for which we create an ___. Decomposing a string into its valid units is referred as: Which one of the following string is a part of EQUAL language? Which of the following is not a step in elimination of states procedure? If FA1 corresponds to (a+b)* then FA1 must accept _____ string/strings. The FA can be drawn for the regular expression (a+b)* with minimum ____ state(s). Suppose we have an alphabet set having four symbols, how many transitions will be there on each state of a finite automaton for any language defined over the given alphabet? A transition graph is converted into a(n) ____ in order to obtain regular expression. If we have a binary number 0011111 and we add 1 in this binary number, then the result will be: While developing NFA for the union of FA1 and FA2, if there is a loop of ‘a’ at the initial state of FA1 then the new initial state will have a transition for ‘a’ that goes straight to: Automata is the plural of ____. In Mealy machine the output depends on ______ Consider FA1 and FA2 are two finite automata representing two different languages. Now FA3 which is the sum of FA1 and FA2 will accept all strings accepted by: Which of the following diagram is very rigid in order to express any language? Every FA should be______. The length of string “AbBAbcd” defined over Σ ={Ab,B,c,d} is _____. In which of the following machine, the length of output string is 1 more than that of input string? Which of the following does not contribute while finding out the length of strings? Which one of the following word is not accepted by the given regular expression? #VALUE! Reverse of string "YxwzYz" defined over Σ ={w,x,Y,z} is ____. If r1 and r2 are regular expressions then (r1 * r2) is a / an _____ . Which of the following doesn't accept any language? Which of the following regular expressions represent same language? How many new states are introduced while developing NFA for the closure of an FA? Consider the following Regular Expression (RE): #VALUE! ted except ______. Introducing new final state in case of multiple final states is the step no. ____ of proving Kleene’s theorem part II. If S = {a, b} then which of the following RE will generate all possible strings? The language {a, ab, aba, bab} is ____ . In regular expressions, the operator ‘*’ stands for Which of the following is the minimal number of states for a finite automaton accepting the language of all strings defined over any alphabet set? Language of all strings whose length is odd and number of y’s is even defined over alphabet set Σ = {x, y}. _____ will be accepted by the given language. Let FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must correspond to the initial state of Decomposing a string into its valid units is referred as: Finite Automaton (FA) has: Which one of the following string is a part of EQUAL language? Which of the following steps replaces multiple incoming transition edges with a single one in proving Kleene’s theorem part II? In an FA, when there is no path starting from initial state and ending in final state then that FA_____. Which of the following statement is NOT true about TG? FA corresponding to an NFA can be built by introducing a state corresponding to the combination of states, for a letter having Considering FA1 and FA2 having 2 states each. Now FA1+FA2 can have maximum ______ number of states. The language of all strings defined over alphabet set = {a, b} containing ‘bbb’ will have the minimum string with length of: In the context of make NFA for the concatenation of FA1 and FA2 (FA2 accepting null string), which of the following option is correct? Kleene’s theorem states that In Moore machine, output is produced over the change of: We cannot construct an NFA for the language of __ defined over alphabet set {a,b}. quiz Let L be the language of all strings, defined over Σ = {0,1}, ending in 111. Which of the following strings are distinguishable with respect to L with z being 11? FA and ___ are same except that ___ has unique symbol for each transition. In the context of make NFA for the concatenation of FA1 and FA2 (FA2 accepting null string), which of the following option is correct? Let FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must correspond to the initial state of Which one of the following word is not accepted by the regular expression (a+b)(aa)(a+b)? A string will be accepted by an NFA if there exists ___ one successful path. In order to make NFA for the union of FA1 and FA2, the new initial state should be linked to: Introducing new final state in case of multiple final states is the step no. ____ of proving Kleene’s theorem part II. In Moore machine the output depends on Automata is the plural of ____. FA of EVEN language shows null string when _____. If two RE’s generate same language then these RE’s are called _____. If we have a finite language and the number of states in the FA is n then the maximum number of letters in the each word of the language that will be accepted by the given FA will be: Which of the following diagrams expresses languages more simply? The recursive method for defining a language has ______ steps. Keeping in view the discussion by Martin, how many states are required to recognize the language of all strings defined over ∑= {a,b}, with ‘a’ being the third letter from right? Which of the following string belongs to the language of the regular expression (aa*b)*? Which one of the following machine is represented as a pictorial representation with states and directed edges labeled by an input letter along with an output character? Let’s suppose we have R1= (xx+yy) and R2=(x+ y). Union of R1 and R2 is _____. Kleene’s Theorem Part II expresses the relationship between _____. A finite state machine with the following state table has a single input x and a single output z. If initial state is unknown, then shortest input sequence to reach the final state C is Keeping in view the discussion by Martin, how many states are required to recognize the language of all strings defined over ∑= {a,b}, with ‘b’ being the second letter from right? Which one of the following word is not accepted by the given regular expression? #VALUE! Which of the following state is introduced while developing NFA for the closure of an FA? Statement if ∑ is finite then ∑* is finite is _____ Which of the following is an utility of state elimination phenomenon? The FA can be drawn for the regular expression (a+b)* with minimum ____ state(s). In case of finite automaton there ___ be a transition on each ____ for every letter of the alphabet set. Kleene’s theorem states that a quiz Following FA will accept Choose the correct word produced by RE (a + b)* (aa+bb). Let FA1 accepts many strings and FA2 accepts none then FA1+FA2 will be equal to: Which of the following is an utility of state elimination phenomenon? Automata is the plural of ____. If we have only one state, having no transition for input letters, then it is an example of: If we have a binary number 11000110 and we add 1 in this binary number, then the result will be: In Mealy machine the output depends on ______ If we have more than one accepting states or an accepting state with an outdegree, which of the following actions will be taken? Let FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must correspond to the initial state of In which of the following machine, the length of output string is 1 more than that of input string? There can be more than ___ FA for a certain language but for ___ FA there is only one language associated with it. If an alphabet has "2" number of letters, then total number of strings of length "3" will be ____. [(a + b)(a + b)]*, given RE cannot generate the string ____. If r1 is a regular expression then (r1)* is ____. In Moore machine is of length n then the output string length will be There __ a language for which only FA can be built but not the RE. 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: Regular languages are closed under the following operations. Finite Automaton (FA) has: While finding RE corresponding to TG, If TG has more than one start state then Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1* Suppose we have FA3 which is the union of FA1 and FA2. Now the initial state of the FA3 will be: a(a+b*b + b(a+b*a is the RE of language defined over Σ={a,b} is ____. If S = {a}, then S+ will be _____. In the context of make NFA for the concatenation of FA1 and FA2 (none accepting null string), which of the following option is correct? There ____ be a unique path for each valid string (called a word) in NFA. The language of all strings defined over alphabet set = {x, y} that ends with different letters will have the maximum length of: Two FAs are said to be equivalent, if they ______.