Question
a.
linear
b.
exponential
c.
logarithmic
d.
none 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. Conversion of regular expression to e-NFA takes ___________ time.
Similar Questions
Discover Related MCQs
Q. The conversion of NFA to DFA can be done in:
View solution
Q. Which of the following cannot be converted in an ordinary NFA?
View solution
Q. NFA to DFA conversion is done via
View solution
Q. State true or false:
Statement: Regular expression can directly be converted to DFA without intermediate steps.
View solution
Q. Is the following statement correct?
Statement: Thompson construction is used to convert Regular expression to finite automata.
View solution
Q. Language classes have the following property:
View solution
Q. Which of the following are decision properties?
View solution
Q. Pick the odd one out of the given properties of a regular language:
View solution
Q. For an automata, which of the following are equivalent variants?
DFA,NFA and NFA with epsilon transitions
View solution
Q. Which of the following are not meant to specify a regular language?
View solution
Q. Which of the following problems do not belong to decision properties?
View solution
Q. Which of the following is a function of Closure properties?
View solution
Q. Suppose there is a string w=abbab, and there exists a DFA which accepts w. How many stepts will be required to test its membership?
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!
