Q. Ndfa and dfa accept same languages

View solution

Q. If the NFA N has n states, then the corresponding DFA D has 2n states

View solution

Q. An NFA is nothing more than a ε-NFA with no ε transitions

View solution

Q. For every DFA, there is a ε-NFA that accepts the same language

View solution

Q. DFAs, NFAs, and ε-NFA s are equivalent

View solution

Q. Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*

View solution

Q. Given the language L = {ab, aa, baa}, which of the following strings are in L*?
1) abaabaaabaa

2) aaaabaaaa

3) baaaaabaaaab

4) baaaaabaa

View solution

Q. Which of the following are regular sets?
I. { a^n b^2m | n>=0, m>=0}

II. {a^n b^m |n=2m}

III. {a^n b^m | n!= m}

IV {xcy |x,y€{a,b)*}

View solution

Q. Let L1 = {w ∈ {0,1}∗ | w has at least as many occurrences
of (110)’s as (011)’s}.
Let L2 = { ∈ {0,1}∗ | w has at least as many occurrences
of (000)’s as (111)’s}.
Which one of the following is TRUE?

View solution

Q. The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _____________
a*b*(ba)*a*

View solution

Q. How many minimum states are required to find whether a string has odd number of 0’s or not

View solution

Q. Consider alphabet ∑ = {0, 1}, the null/empty string λ and the sets of strings X0, X1 and X0.How are X1 and X2 are related ?
X0 = 1 X1

X1 = 0 X1 + 1 X2

X2 = 0 X1 + {λ}

Which one of the following represents the strings in X0?

View solution

Q. Which of the following languages is/are regular?
L1: {wxwR ⎪ w, x ∈ {a, b}* and ⎪w⎪, ⎪x⎪ >0} wR is the reverse of string w

L2: {anbm ⎪m ≠ n and m, n≥0

L3: {apbqcr ⎪ p, q, r ≥ 0}

View solution

Q. The set of all strings over ∑ = {a,b} in which strings consisting a’s and b’s and ending with in bb is

View solution

Q. An individual token is called ________

View solution

Q. Lexical Analyser’s Output is given to Syntax Analysis.

View solution

Q. Lexical Analysis Identifies Different Lexical Units in a _______

View solution

Q. Which one is a type of Lexeme

View solution

Q. The process of forming tokens from an input stream of characters is called_____

View solution

Q. When expression sum=3+2 is tokenized then what is the token category of 3

View solution