What can be said about a regular language L over {a} whose minimal finite state automaton has two states?(a) L must be {an| n is odd}(b) L must be {an| n is even}(c) L must be {an| n is even}(d) Either L must be {an | n is odd}, or L must be {an | n is even}This question was posed to me in an interview.This interesting question is from Obtaining the regular Expression from the Finite automata topic in portion Finite Automata and Regular Expression of Compiler

What can be said about a regular language L over {a} whose minimal fin

1.	What can be said about a regular language L over {a} whose minimal finite state automaton has two states?(a) L must be {an\| n is odd}(b) L must be {an\| n is even}(c) L must be {an\| n is even}(d) Either L must be {an \| n is odd}, or L must be {an \| n is even}This question was posed to me in an interview.This interesting question is from Obtaining the regular Expression from the Finite automata topic in portion Finite Automata and Regular Expression of Compiler
Answer» Correct option is (d) Either L must be {an \| n is ODD}, or L must be {an \| n is even} Easy EXPLANATION: There are TWO STATES. When first state is final, it accepts even no. of a’s. When second state is final, it accepts odd no. of a’s.

Discussion

No Comment Found

Related InterviewSolutions

An individual token is called ________(a) Lexeme(b) Lex(c) Lexeme & Lex(d) None of the mentionedThe question was posed to me in exam.The origin of the question is Lexical Analyser topic in portion Finite Automata and Regular Expression of Compiler
Which phase of the compiler is Lexical Analyser?(a) First(b) Second(c) Third(d) None of the mentionedThe question was posed to me in class test.This is a very interesting question from Lexical Analyser topic in chapter Finite Automata and Regular Expression of Compiler
What is another name for Lexical Analyser?(a) Linear Phase(b) Linear Analysis(c) Scanning(d) All of the mentionedThis question was posed to me in class test.My doubt is from Lexical Analyser in section Finite Automata and Regular Expression of Compiler
The context free grammar is ambiguous if ______________(a) The grammar contains non-terminals(b) Produces more than one parse tree(c) Production has two non-terminals side by side(d) None of the mentionedThe question was asked by my college professor while I was bunking the class.This question is from Lexical Analyser in division Finite Automata and Regular Expression of Compiler
If L1 and L2 are regular languages is/are also regular language(s).(a) L1 + L2(b) L1L2(c) L1(d) All of the mentionedThis question was addressed to me in class test.My question is based upon Obtaining the regular Expression from the Finite automata topic in chapter Finite Automata and Regular Expression of Compiler
The set of all strings over ∑ = {a,b} in which strings consisting a’s and b’s and ending with in bb is?(a) ab(b) a*bbb(c) (a+b)* bb(d) All of the mentionedThis question was addressed to me during an online exam.This intriguing question comes from Obtaining the regular Expression from the Finite automata topic in chapter Finite Automata and Regular Expression of Compiler
Which of the following pairs of regular expression are equivalent?(a) 1(01)* and (10)*1(b) X(xx)* and (xx)*x(c) 1(01)* and (10)*1 & X(xx)* and (xx)*x(d) None of the mentionedThe question was asked in my homework.The query is from Obtaining the regular Expression from the Finite automata topic in section Finite Automata and Regular Expression of Compiler
Which one of the following is FALSE?(a) Every NFA can be converted to DFA(b) Every subset of a recursively enumerable set is recursive(c) All of the mentioned(d) None of the mentionedThis question was addressed to me by my college professor while I was bunking the class.The above asked question is from Minimization of DFA topic in division Finite Automata and Regular Expression of Compiler
How many minimum states are required to find whether a string has odd number of 0’s or not?(a) 1(b) 2(c) 3(d) 4This question was addressed to me by my school teacher while I was bunking the class.This is a very interesting question from Obtaining the regular Expression from the Finite automata in section Finite Automata and Regular Expression of Compiler
The set of all strings over ∑ ={a,b} in which a single a is followed by any number of b’s a single bfollowed by any number of a’s is?(a) ab* + ba*(b) ab*ba*(c) a*b + b*a(d) None of the mentionedThe question was posed to me by my school teacher while I was bunking the class.Origin of the question is Obtaining the regular Expression from the Finite automata topic in division Finite Automata and Regular Expression of Compiler

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment