Question

A regular expression for the language with all strings not ending in 10 on {0, 1} can be: Select one: a. 00 + 01 + 11 + 0 + ? + 1 b. 00 + 01 + 11 + 0 + 1. c. (0 + 1)$^*(00 + 01 + 11) + ? + 0 + 1. d. 00 + 01 + 11 + 0 Which of the following are true: (1). The language L = \{a$^nb$^m: n ? 1\} U \{a$^nb$^m: n ? 1, m ? 1\} is regular. (2). The language L = \{a$^nb$^n: n ? 1\} U \{a$^nb$^m+2: n ? 1\} is regular Select one: a. Neither (1) nor (2) is true. b. Both (1) and (2) are true. c. (1) is true and (2) is false. d. (1) is false and (2) is true.

          A regular expression for the language with all strings not ending in 10 on {0, 1} can be:
Select one:
a. 00 + 01 + 11 + 0 + ? + 1
b. 00 + 01 + 11 + 0 + 1.
c. (0 + 1)$^*(00 + 01 + 11) + ? + 0 + 1.
d. 00 + 01 + 11 + 0
Which of the following are true: (1). The language L = \{a$^nb$^m: n ? 1\} U \{a$^nb$^m: n ? 1, m ? 1\} is regular. (2). The
language L = \{a$^nb$^n: n ? 1\} U \{a$^nb$^m+2: n ? 1\} is regular
Select one:
a. Neither (1) nor (2) is true.
b. Both (1) and (2) are true.
c. (1) is true and (2) is false.
d. (1) is false and (2) is true.

$A regular expression for the language with all strings not ending in 10 on 0, 1 can be: Select one: a. 00 + 01 + 11 + 0 + ? + 1 b. 00 + 01 + 11 + 0 + 1. c. (0 + 1)^*(00 + 01 + 11) + ? + 0 + 1. d. 00 + 01 + 11 + 0 Which of the following are true: (1). The language L = {a^nb^m: n ? 1} U {a^nb^m: n ? 1, m ? 1} is regular. (2). The language L = {a^nb^n: n ? 1} U {a^nb^m+2: n ? 1} is regular Select one: a. Neither (1) nor (2) is true. b. Both (1) and (2) are true. c. (1) is true and (2) is false. d. (1) is false and (2) is true.$

Added by Michael S.

Question

Please give Ace some feedback