Re: Languages are regualar
- From: 『くじょう けい』 <tj6225@xxxxxxxxx>
- Date: 18 Apr 2007 10:41:39 -0700
On 4月17日, 下午8时03分, 『 』 <tj6...@xxxxxxxxx> wrote:
L={a^nb^m | n/m is an integer}
L=(a^nb^m | n >= 25 m <=25}
Could someone give me some hints on how to do these problems?
Thanks.
Oops, I figured our s=a^pb^p didn't work.
I came up with this:
Let s=a^pab^(p+1)
Then x is some a's or empty, y is the remaining a's of a^p, then pump
down to zero, xy^0z then the numerator( |x|+1 ) will be smaller than
the denominator( p+1) ).
So n/m cannot be an integer.
Is that a good string that I chose?
.
- References:
- Languages are regualar
- From: 『⑼ⅷぅ⑩ ⅰ⑧』
- Languages are regualar
- Prev by Date: Re: Languages are regualar
- Next by Date: Re: Dynamic cycle Detection
- Previous by thread: Re: Languages are regualar
- Next by thread: From where I can know and study AI Philosophy and its possible mathematical/biological/computational basis.
- Index(es):
Relevant Pages
|