Menu

Question Discussion & Solution

MCQ
Q.
How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Regular expressions are closed under
forum Discussion
MCQ
2.
Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least
forum Discussion
MCQ
3.
According to the given language, which among the following expressions does it corresponds to?
Language L={x?{0,1}|x is of length 4 or less}
forum Discussion
MCQ
4.
Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then
forum Discussion
MCQ
5.
Which of the following is true?
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
article

Finite Automata

format_list_bulleted 44 MCQs
article

Context Free Grammars

format_list_bulleted 76 MCQs
article

Push Down Automata

format_list_bulleted 37 MCQs
article

Regular and context free languages

format_list_bulleted 65 MCQs
article

Pumping Lemma

format_list_bulleted 14 MCQs
article

Turning Machine

format_list_bulleted 14 MCQs