Linear Context Free Grammar
From: Behrang (bassemi_at_math.sharif.edu)
Date: 01/25/04
- Next message: Matt: "Re: Algorithm to generate all possible deals"
- Previous message: Pento: "Re: Turing machine"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 25 Jan 2004 06:01:40 -0800
A CFG is Linear if all production rules are in form of A->@B# in
which, A,B are variables and @,# are members of T* .
Consider language L={w in {a,b}* | number of a >= number of b}
Is it Linear CF?
Is there any relationship between Linear CF languages and
Deterministic CF Languages?
It would be appriciated if anyone answers these questions,
Behrang.
- Next message: Matt: "Re: Algorithm to generate all possible deals"
- Previous message: Pento: "Re: Turing machine"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
