Which of the technique can be used to prove that a language is non regular?(a) Ardens theorem(b) Pumping Lemma(c) Ogden’s Lemma(d) None of the mentionedI have been asked this question in an interview.This interesting question is from Properties-Non Regular Languages in section Regular Expressions and Languages of Automata Theory

Which of the technique can be used to prove that a language is non reg

1.	Which of the technique can be used to prove that a language is non regular?(a) Ardens theorem(b) Pumping Lemma(c) Ogden’s Lemma(d) None of the mentionedI have been asked this question in an interview.This interesting question is from Properties-Non Regular Languages in section Regular Expressions and Languages of Automata Theory
Answer» Right option is (b) Pumping Lemma To EXPLAIN: We use the POWERFUL technique called Pumping Lemma, for showing certain languages not to be REGULAR. We use ARDENS theorem to find out a regular expression out of a finite AUTOMATON.

Discussion

No Comment Found

Related InterviewSolutions

Which of the following are non regular?(a) The set of strings in {a,b}* with an even number of b’s(b) The set of strings in {a, b, c}* where there is no c anywhere to the left of a(c) The set of strings in {0, 1}* that encode, in binary, an integer w that is a multiple of 3. Interpret the empty strings e as the number 0.(d) None of the mentionedI have been asked this question at a job interview.This intriguing question comes from Properties-Non Regular Languages in chapter Regular Expressions and Languages of Automata Theory
The output of the lexical and syntax analyzer can stated as:(a) parse stream, parse tree(b) token tree, parse tree(c) token stream, parse tree(d) all of the mentionedI got this question in class test.The origin of the question is Lexical Analysis in division Regular Expressions and Languages of Automata Theory
Which among the following statement is correct?Statement 1: When the analyzer scans ‘int’ and ‘intvalue’, it is not able to decide whether the int leads to a keyword or an identifier.Statement 2: Longest Match Rule(a) Statement 1 is assertion, Statement 2 is the reason(b) Statement 1 is assertion, Statement 2 is the solution(c) There is no such Statement 2(d) This is not a function of Lexical AnalyzerThis question was addressed to me in my homework.Question is taken from Lexical Analysis in section Regular Expressions and Languages of Automata Theory
State true or false:Statement:A lexical analyzer reads the source code line by line.(a) Statement:A lexical analyzer reads the source code line by line.(b) True(c) FalseThe question was posed to me during an online interview.I'm obligated to ask this question of Lexical Analysis topic in portion Regular Expressions and Languages of Automata Theory
Which of the following do Regexps do not find their use in?(a) search engines(b) word processors(c) sed(d) none of the mentionedThe question was asked in an interview.I need to ask this question from Converting Regular Expressions to Automata in division Regular Expressions and Languages of Automata Theory
Regular expression are(a) Type 0 language(b) Type 1 language(c) Type 2 language(d) Type 3 languageThis question was addressed to me during an online interview.My question comes from Regular Language & Expression topic in section Regular Expressions and Languages of Automata Theory
Can the given state diagram be reduced?(a) Yes(b) NoI got this question by my school principal while I was bunking the class.I would like to ask this question from Conversion by Eliminating states in chapter Regular Expressions and Languages of Automata Theory
Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be(a) {w | w is a string of odd length}(b) {w | w is a string of length multiple of 3}(c) {w | w is a string of length 3}(d) All of the mentionedThis question was posed to me in a national level competition.Question is from Building Regular Expressions in division Regular Expressions and Languages of Automata Theory
Which among the following can be an annihilator for multiplication operation?(a) 0(b) 1(c) 100(d) 22/7I had been asked this question in my homework.Question is from Finding Patterns in Text,Algebric Laws and Derivatives in division Regular Expressions and Languages of Automata Theory
Which of the following pair of regular expression are not equivalent?(a) 1(01)* and (10)*1(b) x(xx)* and (xx)*x(c) (ab)* and a*b*(d) x+ and x*x+This question was addressed to me in an internship interview.Enquiry is from Regular Language & Expression in section Regular Expressions and Languages of Automata Theory

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment