Re: help with regular expressions

keith <johndoe@yahoo.com> writes:


> write the regular expression for strings over the alphabet {a,b,c}
> that don't contain the contiguous substring baa. I've come up with
> this:
>
> (a|c|(ba(b|c))|bb|bc)*
>
> ??? Is this correct?


No, the strings "bbaa" and "babaa" are in the language you describe.


> binary numbers n such that there exists an integer solution of an+bn=cn,
> don't know what to do about this one :-( As far as I am concerned all
> binary numbers satisfy this condition as integer+*integer=integer.


The exercise says a^n+b^n=c^n, for which Fermats theorem says that
there exist integer solutions only when 0<=n<=2.


Torben


[I have an elegant regular expression that solves the problem, but
the margin of this message is too small to contain it.
-John]

Return to the comp.compilers page.
Search the comp.compilers archives again.