Languages are regualar
- From: 『⑼ⅷぅ⑩ ⅰ⑧』 <tj6225@xxxxxxxxx>
- Date: 17 Apr 2007 20:03:24 -0700
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.
.
- Follow-Ups:
- Re: Languages are regualar
- From: 『くじょう けい』
- Re: Languages are regualar
- From: 『くじょう けい』
- Re: Languages are regualar
- From: Torben Ægidius Mogensen
- Re: Languages are regualar
- Prev by Date: Re: more again: the complexity of Hamiltonian problem on 2-regular digraph
- Next by Date: Re: Multidimensional binary search trees
- Previous by thread: avoiding left recursion in a grammar with the production S->€
- Next by thread: Re: Languages are regualar
- Index(es):
