Re: Languages are regualar
- From: torbenm@xxxxxxxxxxxxx (Torben Ægidius Mogensen)
- Date: Wed, 18 Apr 2007 09:21:33 +0200
Úßè¹Ö áÔÛ <tj6225@xxxxxxxxx> writes:
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?
First use half an hour to try making (or describing) regular
expressions or finite automata that describe each of these languages.
If you fail, use the next half hour to try proving them non-regular
using the pumping lemma. If that also fails, go back and continue on
the first track, and so on.
Hint: One of the above is regular, the other isn't.
Torben
.
- References:
- Languages are regualar
- From: 『⑼ⅷぅ⑩ ⅰ⑧』
- 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: Languages are regualar
- Next by thread: Re: Languages are regualar
- Index(es):
Relevant Pages
|
