In this post, we will see how to resolve Given a binary alphabet {0,1}, write a regular expression that recognises all words that have an even number of ’1’s and starts and ends with a ’0’ Question: I’m working through ...
Question: I understand that { an bn | n>=1 } is not regular using Pumping Lemma. But then, how is { an bn | n<=10 } regular? I thought we couldn’t store the number of a and b in an ...
Question: I am trying to Capitalize the first letter of each word in a string. I found similar questions online but none seem to answer my question of ignoring Contractions like can’t, won’t, wasn’t. This snippet of code works but ...