Re: separating context-free languages by simpler languages
- From: sasha <REMOVEIThleba@xxxxxxxxxxxxxxxxxxxxx>
- Date: Fri, 19 Aug 2005 17:48:35 +0200
And two more questions:
Is there a pair of two disjoint context-free languages (L1, L2) so that
neither L1 nor L2 is deterministic context-free, but
(a)
there is no pair of disjoint regular languages (R1, R2) with Li subset
Ri (i=1,2).
(b)
there is no pair of disjoint deterministic context-free languages
(D1, D2) with Li subset Di (i=1,2).
.
- Prev by Date: Re: Distance in Denotational Semantics?
- Next by Date: Re: Minimum Memory Requirements
- Previous by thread: A question about restricted shortest path computing
- Next by thread: Solving linear system of equalities AND disequalities
- Index(es):