6. (10 marks) Let = {'[', ']',',', '0', '1'}, and let L6 C * be the...

 

Transcribed Image Text:

6. (10 marks) Let = {'[', ']',',', '0', '1'}, and let L6 C Σ* be the language containing list representations of finite sets of binary strings: i.e., every string x Le is of the form x = '[x0,x1,..., In]', where: ⚫for all 0 < i < n, x, is a string in {0,1}*, and none of the axis repeat: if i j, then x, xj. Show that L6 is not regular. 6. (10 marks) Let = {'[', ']',',', '0', '1'}, and let L6 C Σ* be the language containing list representations of finite sets of binary strings: i.e., every string x Le is of the form x = '[x0,x1,..., In]', where: ⚫for all 0 < i < n, x, is a string in {0,1}*, and none of the axis repeat: if i j, then x, xj. Show that L6 is not regular.

Answer rating: 100% (QA)

QUESTION ANSWER Given L6 2 0 1 16 1 x x0 x xn for all ... View the full answer