Multiple Choice
A language L is accepted by a FSA iff it is
A) CFL
B) CSL
C) Recursive
D) Regular
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q3: Any given transition graph has an equivalent:<br>A)regular<br>B)DFSM
Q4: Given an arbitrary non-deterministic finite automaton NFA
Q5: Which one of the following statement is
Q6: Grammars that can be translated to DFAs:<br>A)Left
Q7: Which of the following is true with
Q9: Type-1 Grammar is known as_<br>A)CFG<br>B)CSG<br>C)REGULAR<br>D)All
Q10: Let L<sub>1</sub> = {w ? {0,1}? |
Q11: Regular expressions are<br>A)Type 0 language<br>B)Type 1 language<br>C)Type
Q12: Let w be any string of length
Q13: Consider the regular language L = (111+111111)*.