Re: Is this language context free?
Dillon wrote:
This is a problem I have been working on for a while:
Consider the following language L over the alphabet {a, b, c}. L = {xyz
| x = y^R, z is a string with only c's, and lx|¡Ù lzl }. Here y^R
denotes the string obtained by reversing y.
Is L context free?
You seem to have some corruption in your notation there. What does
"lx|¡Ù lzl" mean? Can you explain it in words?
Without that unknown condition, this language is trivially context-free.
--
Chris Smith
.
Relevant Pages
- Re: Is this language context free?
... Here y^R denotes the string obtained by reversing y. ... Is L context free? ... this language is trivially context-free. ...
(comp.theory) - context free languages under SCRAMBLE operation
... For strings w and t, write w =' t if the symbols of w are a permutation of the symbols of t. ... which accepts the regular language to be scrambled can simply have its state transitions re-arranged to accept the SCRAMBLE of the language. ... This is de facto context free since every regular language is in turn context free. ...
(comp.theory) - Re: pumping lemma for CFL
... >>>lemma for context free languages ... ... >>>p such that a string longer than p is uvwxy where |vwx| ... > In my mind the *essence* of the pumping lemmas is ... > while remaining in the language. ...
(sci.math) - Re: need help developin better sense for context free languages
... Are there any tell tale signs that it is/is not context free? ... Is there an easy way to tell starigh away if a language is context free ... tested on the use of closure properties to determine ... K chosen as the right one to use?"), With a little practice with those ...
(comp.theory) - Re: need help developin better sense for context free languages
... Is there an easy way to tell starigh away if a language is context free ... side conditions on equality of substrings or lengths of substrings, ... tested on the use of closure properties to determine ...
(comp.theory) |
|
