Question
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 mentioned
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be
Similar Questions
Discover Related MCQs
Q. If ∑= {0,1}, then Ф* will result to:
View solution
Q. The given NFA represents which of the following NFA
View solution
Q. Which of the following represents a language which has no pair of consecutive 1’s if ∑= {0,1}?
View solution
Q. The finite automata accept the following languages:
View solution
Q. (a + b*c) most correctly represents:
View solution
Q. Which of the following regular expressions represents the set of strings which do not contain a substring ‘rt’ if ∑= {r, t}
View solution
Q. According to the precedence rules, x-y-z is equivalent to which of the following?
View solution
Q. Dot operator in regular expression resembles which of the following?
View solution
Q. Which among the following is not an associative operation?
View solution
Q. Which among the following is equivalent to the given regular expression?
01*+1
View solution
Q. The total number of states required to automate the given regular expression
(00)*(11)*
View solution
Q. Generate a regular expression for the following problem statement:
Password Validation: String should be 8-15 characters long. String must contain a number, an Uppercase letter and a Lower case letter.
View solution
Q. Generate a regular expression for the following problem statement:
P(x): String of length 6 or less for å={0,1}*
View solution
Q. The minimum number of states required in a DFA (along with a dumping state) to check whether the 3rd bit is 1 or not for |n|>=3
View solution
Q. Which of the regular expressions corresponds to the given problem statement:
P(x): Express the identifiers in C Programming language
l=letters
d=digits
View solution
Q. Generate a regular expression for the given language:l
L(x): {xÎ{0,1}*| x ends with 1 nd does not contain a substring 01}
View solution
Q. The minimum number of transitions to pass to reach the final state as per the following regular expression is:
{a,b}*{baaa}
View solution
Q. Which of the following is an utility of state elimination phenomenon?
View solution
Q. If we have more than one accepting states or an accepting state with an outdegree, which of the following actions will be taken?
View solution
Q. Which of the following is not a step in elimination of states procedure?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!