Can a DFA simulate NFA?
| A. | NO |
| B. | YES |
| C. | SOMETIMES |
| D. | Depends on NFA |
|
Option: B Explanation : Click on Discuss to view users comments. |
Which of the following statements is wrong ?
| A. | The language accepted by finite automata are the languages denoted by regular expressions |
| B. | For every DFA there is a regular expression denoting its language |
| C. | For a regular expression r, there does not exist NFA with L(r) any transit that accept |
| D. | None of these |
|
Option: C Explanation : Click on Discuss to view users comments. |
Regular expression a / b denotes the set
| A. | {a} |
| B. | { ∈ , a, b } |
| C. | {a, b} |
| D. | { ab } |
|
Option: C Explanation : Click on Discuss to view users comments. |
Regular expression (a | b ) (a | b) denotes the set
| A. | { a, b, ab, aa } |
| B. | { a, b, ba, bb } |
| C. | { a, b } |
| D. | { aa, ab, ba, bb } |
|
Option: D Explanation : Click on Discuss to view users comments. |
Which of the following regular expressions denotes zero or more instances of an a or b ?
| A. | a | b |
| B. | (ab)* |
| C. | (a | b)* |
| D. | a* I b |
|
Option: C Explanation : Click on Discuss to view users comments. debi said: (3:07pm on Thursday 18th April 2013)
I BELIEVE IT IS OPTION C AS IN QUESTION IT IS EMPHASIZING ON 0 OR(OR BEING IMPORTANT) MORE INSTANCES OF A OR B
punit said: (12:45pm on Wednesday 8th May 2013)
I think most suitable answer is c as it gives all instances of a and b. its provide all string of length 0 or more. B does not provide string of odd length
|
