Re: Any solution to this problem?
- From: Martin Fuchs <usenet-ng@xxxxxxx>
- Date: Wed, 27 Apr 2005 15:45:13 +0200
Burt Price wrote:
A PDA for for the language: {(a^n)(b^2n)} with only 2 states.
Try to transform the grammar G=({S},{a,b},P,S)
with S -> \eps | abb | aSbb
into a PDA and you will get a PDA having only
1 state.
mf .
- Follow-Ups:
- Re: Any solution to this problem?
- From: Burt Price
- Re: Any solution to this problem?
- References:
- Any solution to this problem?
- From: Burt Price
- Any solution to this problem?
- Prev by Date: Any solution to this problem?
- Next by Date: Re: Reply: Time dependent shortest path
- Previous by thread: Any solution to this problem?
- Next by thread: Re: Any solution to this problem?
- Index(es):
