Question 12\ Which are ways which we could describe the relationship between a language L1 and a Finite state\ machine M1:\

L1={0,10,110.000,1110.111000,dots}

\ L1 is a subset of

M1

\

L1=L(M1)

\ L1 recognizes the alphabet (Sigma)\ M1 recognizes

L1

\ The language of

M1

is

L1

\ All of the above\ Question 13\ Choose the regular expression which describes the language that is accepted by the following FSA:\ Hint: Think of strings the Regular Expression could generate but are NOT accepted by the FSA? and visa\ versa\

a^(x)b^(x)aba(a|b)(a|b)^(x)

\

a^(2)bb+a^(2)(a|b)(a|b)^(2)

\

a^(2)b+aa(a|b)(a|b)^(2)

\

a^(x)b^(x)a^(x)b

\ None of the above

Which are ways which we could describe the relationship between a language L1 and a Finite state machine M1: L1={0,10,110.000,1110.111000,} L1 is a subset of M1 L1=L(M1) L1 recognizes the alphabet (Sigma) M1 recognizes L1 The language of M1 is L1 All of the above Question 13 5 pts Choose the regular expression which describes the language that is accepted by the following FSA: Hint: Think of strings the Regular Expression could generate but are NOT accepted by the FSA? and visa versa axbxaba(ab)(ab)2 a2bb+a2(ab)(ab)2 a2b+aa(ab)(ab)2 axbxaxb None of the above