a. All strings must end with a \"b\" b. All string must start with a \"b\" and e

ID: 3836900 • Letter: A

Question

a. All strings must end with a "b"

b. All string must start with a "b" and end with a"b"

c. All string must contain an "a"

d. All string may pr may not conatin "a" but they have to end with a "b"

e. None of the above

2. which of the following statement is false about the "test_graph_01" FA:

a. "a" is a valid string for the model.

b. the set of final states is F = (2).

c. The start state is 1.

d. "bbbabbb" is a valid string for the model.

e. All of the above statements are true.

3. What is an equivalent regular expression for the "test_graph_01" FA: "

a. RE = b*ab*

b. RE = (a|b)*

c. RE = ab+

d. RE = (|b)* (a|) (|b)*

4. Which of the following statement is false about the "test_graph_01" FA: "

a. All the accepted strings contain even number of a's and even number of b's.

b. The set of b's.

c. All the accepted string contain equal number of a's and b's.

test graph 01 test graph 02 Parse Tree

1.Which of the following statement is true

Ans: c. All string must contain an "a".

2. which of the following statement is false

Ans: "bbbabbb" is a valid string for the model.

3.What is an equivalent regular expression for the "test_graph_01" FA: "

Ans: d. RE = (|b)* (a|) (|b)*

4. Which of the following statement is false about the "test_graph_01" FA: "

Ans: b. The set of b's.

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.