Re: CFG for L(G) and L(G')
- From: "jason_box" <cppisfun@xxxxxxxxx>
- Date: 23 Feb 2006 10:46:16 -0800
Is this not the start of creating CNF? For the three conditions it
always start out given any CFG G, where epsilonis not part of L(G) can
you create langague where it has no epsilon productions, unit
productions and usless productions and also same for GNF. My question
was what if the condition on the given CFG G had epsilon in L(G) how
would I transformat the language so L(G') = L(G) - epsilonholds and
there are no more epsilon transitions.
.
- References:
- CFG for L(G) and L(G')
- From: jason_box
- Re: CFG for L(G) and L(G')
- From: Torben Ægidius Mogensen
- CFG for L(G) and L(G')
- Prev by Date: Re: revision algorithms
- Next by Date: Re: revision algorithms
- Previous by thread: Re: CFG for L(G) and L(G')
- Next by thread: Call for Papers: IAENG International Workshop on Operations Research (of IMECS 2006)
- Index(es):
Relevant Pages
|