Curry-Howard isomorphism. Proving that a sentences are “well-formed” is the same as implementing an algorithm which takes a string and returns a Boolean. You

Curry-Howard isomorphism. Proving that a sentences are “well-formed” is the same as implementing an algorithm which takes a string and returns a Boolean. You can call this function “is_well_formed?” I await your proof in the regular language you have specified above.