MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
Regular_expressions_are_closed_under$..
1.
Regular_expressions_are_closed_under$
A.
Union
B.
Intersection
C.
Kleen star
D.
All of the mentioned
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
L_AND_~L_ARE_RECURSIVE_ENUMERABLE_THEN_L_IS?$
Regular_expressions_are_closed_under$
Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then
Regular grammar is
A language is regular if and only if
How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply