How to prove that $L={a^kb^mc^{m-k}|mge kge0, m-kge k}$ is not context-free language?
$begingroup$
Prove that $L={a^kb^mc^{m-k}|mge kge0, m-kge k}$ is not context-free language.
We can suppose by contradiction that $L$ is context-free and choose $Z=a^kb^{2k}c^k$.
Using pumping lemma, $vwx$ can't have both $a$'s and $c$'s because $|vwx|le k$. There're $3$ cases:
1) $anotin vx, |vx|ge 1$ and $bin vx$. For $i=0:$ $$
Z_0=uv^0wx^0y=a^kb^{2k-l}c^{k-t}\lge 1\tge 0
$$ In this case $2k-lle 2kimplies Z_0notin L$.
2) $anotin vx, |vx|ge 1$ and $bnotin vx$ and $cin vx, |vx|ge 1$. For $i=0:$ $$
i=0: Z_0= uv^0wx^0y=a^kb^{2k-t}c^{k-l}\lge 1\tge 0
$$
In this case $k-l<kimplies Z_0notin L$
3) $ain vx, |vwx|le k, cnotin vx$. For $i=0:$
$$
Z_0=uv^0wx^0y=a^{k-l}2^{2k-t}c^k
$$
In this case $k-l<kimplies Z_0notin L$
I'm not sure that my proof good. If not what are my mistakes?
proof-writing context-free-grammar pumping-lemma
$endgroup$
add a comment |
$begingroup$
Prove that $L={a^kb^mc^{m-k}|mge kge0, m-kge k}$ is not context-free language.
We can suppose by contradiction that $L$ is context-free and choose $Z=a^kb^{2k}c^k$.
Using pumping lemma, $vwx$ can't have both $a$'s and $c$'s because $|vwx|le k$. There're $3$ cases:
1) $anotin vx, |vx|ge 1$ and $bin vx$. For $i=0:$ $$
Z_0=uv^0wx^0y=a^kb^{2k-l}c^{k-t}\lge 1\tge 0
$$ In this case $2k-lle 2kimplies Z_0notin L$.
2) $anotin vx, |vx|ge 1$ and $bnotin vx$ and $cin vx, |vx|ge 1$. For $i=0:$ $$
i=0: Z_0= uv^0wx^0y=a^kb^{2k-t}c^{k-l}\lge 1\tge 0
$$
In this case $k-l<kimplies Z_0notin L$
3) $ain vx, |vwx|le k, cnotin vx$. For $i=0:$
$$
Z_0=uv^0wx^0y=a^{k-l}2^{2k-t}c^k
$$
In this case $k-l<kimplies Z_0notin L$
I'm not sure that my proof good. If not what are my mistakes?
proof-writing context-free-grammar pumping-lemma
$endgroup$
add a comment |
$begingroup$
Prove that $L={a^kb^mc^{m-k}|mge kge0, m-kge k}$ is not context-free language.
We can suppose by contradiction that $L$ is context-free and choose $Z=a^kb^{2k}c^k$.
Using pumping lemma, $vwx$ can't have both $a$'s and $c$'s because $|vwx|le k$. There're $3$ cases:
1) $anotin vx, |vx|ge 1$ and $bin vx$. For $i=0:$ $$
Z_0=uv^0wx^0y=a^kb^{2k-l}c^{k-t}\lge 1\tge 0
$$ In this case $2k-lle 2kimplies Z_0notin L$.
2) $anotin vx, |vx|ge 1$ and $bnotin vx$ and $cin vx, |vx|ge 1$. For $i=0:$ $$
i=0: Z_0= uv^0wx^0y=a^kb^{2k-t}c^{k-l}\lge 1\tge 0
$$
In this case $k-l<kimplies Z_0notin L$
3) $ain vx, |vwx|le k, cnotin vx$. For $i=0:$
$$
Z_0=uv^0wx^0y=a^{k-l}2^{2k-t}c^k
$$
In this case $k-l<kimplies Z_0notin L$
I'm not sure that my proof good. If not what are my mistakes?
proof-writing context-free-grammar pumping-lemma
$endgroup$
Prove that $L={a^kb^mc^{m-k}|mge kge0, m-kge k}$ is not context-free language.
We can suppose by contradiction that $L$ is context-free and choose $Z=a^kb^{2k}c^k$.
Using pumping lemma, $vwx$ can't have both $a$'s and $c$'s because $|vwx|le k$. There're $3$ cases:
1) $anotin vx, |vx|ge 1$ and $bin vx$. For $i=0:$ $$
Z_0=uv^0wx^0y=a^kb^{2k-l}c^{k-t}\lge 1\tge 0
$$ In this case $2k-lle 2kimplies Z_0notin L$.
2) $anotin vx, |vx|ge 1$ and $bnotin vx$ and $cin vx, |vx|ge 1$. For $i=0:$ $$
i=0: Z_0= uv^0wx^0y=a^kb^{2k-t}c^{k-l}\lge 1\tge 0
$$
In this case $k-l<kimplies Z_0notin L$
3) $ain vx, |vwx|le k, cnotin vx$. For $i=0:$
$$
Z_0=uv^0wx^0y=a^{k-l}2^{2k-t}c^k
$$
In this case $k-l<kimplies Z_0notin L$
I'm not sure that my proof good. If not what are my mistakes?
proof-writing context-free-grammar pumping-lemma
proof-writing context-free-grammar pumping-lemma
edited Dec 21 '18 at 16:05
Yos
asked Dec 16 '18 at 18:52
YosYos
1,1631823
1,1631823
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3043003%2fhow-to-prove-that-l-akbmcm-km-ge-k-ge0-m-k-ge-k-is-not-context-free%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3043003%2fhow-to-prove-that-l-akbmcm-km-ge-k-ge0-m-k-ge-k-is-not-context-free%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown