QUESTION $1$

True or False. All finite language $($languages with a finite number of strings$)$ can be expressed as a Regular Expression

True

False

$1$ points

QUESTION $2$

Consider the following Regular Expression:

a$?$c$*($bb$|$a$)+$c$?$

Select all of the following strings that match$/$would be accepted by this regular expression

caaaabbabbc

accbbabbbac

None of the options are correct

abbabbac

acabbacabbc

bbaca

$1$ points

QUESTION $3$

Consider the following Regular Expression:

$1*(10|(000|111)+)*$

Select all of the following strings that match$/$would be accepted by this regular expression

None of the options are correct

$1001011110$

$111110111$

$01111011110$

$1$

$00101010000$