Multiple Choice
Automaton accepting the regular expression of any number of a ' s is:
A) a*
B) ab*
C) (a/b) *
D) a*b*c
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q32: A language is represented by a regular
Q33: Which of the following regular expression identity
Q34: The minimum state automaton equivalent to the
Q35: Consider the following CFG S ? aB
Q36: Which of the following are regular sets?<br>A)I
Q38: The regular sets are closed under:<br>A)Union<br>B)Concatenation<br>C)Kleene closure<br>D)All
Q39: Given a Non-deterministic Finite Automation (NFA) with
Q40: The following grammar<br>G = (N, T, P,
Q41: Which of the following statement is wrong?<br>A)Any
Q42: Which one of the following languages over