Im having a problem in solving the problem:- Its an assignment, i solved it, but it seems to be too long and vague, Can anyboby help me please...... Regular expression for the strings with even number of a's and odd number of b's where the character set={a,b}. Thanks in advance... ...
Hey all, I feel like a moron posting such simple questions on here, but the knowledge base of this site is just amazing. Thanks for your understanding. Concerning a question about finding the minimum pumping length (concerning the pumping lemma for regular languages) of a regular expression: Regular Expression R = 1011 (over the alph...
As the name suggests we may think that regular expressions can match regular languages only. But regular expressions we use in practice contain stuff that I am not sure it's possible to implement with their theoretical counterparts. How for example would you simulate a back-reference? So the question arises: what is the theoretical power...
I've seen a few comments here that mention that modern regular expressions go beyond what can be represented in a regular language. How is this so? What features of modern regular expressions are not regular? Examples would be helpful. ...
I am stumped by this practice problem (not for marks): {w is an element of {a,b}* : the number of a's is even and the number of b's is even } I can't seem to figure this one out. In this case 0 is considered even. A few acceptable strings: {}, {aa}, {bb}, {aabb}, {abab}, {bbaa}, {babaabba}, and so on I've done similar examples where t...
I am studying membership algorithms and I am working on this particular problem which says the following: Exhibit an algorithm that, given any regular language L, determines whether or not L = L* So, my first thought was, we have L* which is Kleene star of L and to determine if L = L*, well couldn't we just say that since L is regular,...