Question: Answer this please - ( * * Show that the following langue only accepts two words. * ) Theorem ex 6 : ( 0

Answer this please-(**
Show that the following langue only accepts two words.
*)
Theorem ex6:
("0">>"1" U "1">>"0")== fun w =>(w =["0"; "1"]\/ w =["1"; "0"]).
Proof.
Admitted.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!