Big problem with this NFA into DFA :((
From: FlicK (zeldino_at_hotmail.com)
Date: 02/11/04
- Next message: Michael N. Christoff: "Re: Web Sites for Complexity Theory"
- Previous message: Pento: "Re: max flow in reverse"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Wed, 11 Feb 2004 13:51:32 GMT
I have big problem with this NFA:
Start with --a-- or --b-- in loop then read --bba--, then read --a--
or --b-- in loop and at the end read --b-- and the NFA accept.
(a+b)* bba (a+b)* b (is it correct this Regular Expression?)
but continue with: OR read --a-- and accept for ODD
What is the regular expression for this?
This is the problem: I must separate into two NFA? or in a unique NFA?
The subset construction is very hard :( Please help :((
Thank you!
P.S. a^2n+1 b^n is this Context Free Grammar correct?
S --> ASB | aaa
A --> a
B --> b
- Next message: Michael N. Christoff: "Re: Web Sites for Complexity Theory"
- Previous message: Pento: "Re: max flow in reverse"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|