Prove that $L= $ $w $ ends with a palindrome of length greater than or equal to $4$ is nonregular using the pumping lemma.
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
The alphabet is $a, b$
Hi, I tried this:
Assume to the contrary that $L$ is regular. Let $p$ be the pumping length given by the pumping lemma. Let $s$ be the string $a^pba^p$. Because $s$ is a member of $L$ and $s$ has length more than $p$, the pumping lemma guarantees that $s$ can be split into three pieces, $s=xyz$, satisfying the three conditions of the lemma:
1. for each $ige0,xy^izin L,$
2. $|y|>0, and$
3. $|xy| le p.$
$x=a^s, y=a^t,z=a^p-s-tba^p$
for $i=0,$ $xy^0z in L$
I don't understand how to solve it.
Thanks.
automata regular-language pumping-lemma
add a comment |Â
up vote
0
down vote
favorite
The alphabet is $a, b$
Hi, I tried this:
Assume to the contrary that $L$ is regular. Let $p$ be the pumping length given by the pumping lemma. Let $s$ be the string $a^pba^p$. Because $s$ is a member of $L$ and $s$ has length more than $p$, the pumping lemma guarantees that $s$ can be split into three pieces, $s=xyz$, satisfying the three conditions of the lemma:
1. for each $ige0,xy^izin L,$
2. $|y|>0, and$
3. $|xy| le p.$
$x=a^s, y=a^t,z=a^p-s-tba^p$
for $i=0,$ $xy^0z in L$
I don't understand how to solve it.
Thanks.
automata regular-language pumping-lemma
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
The alphabet is $a, b$
Hi, I tried this:
Assume to the contrary that $L$ is regular. Let $p$ be the pumping length given by the pumping lemma. Let $s$ be the string $a^pba^p$. Because $s$ is a member of $L$ and $s$ has length more than $p$, the pumping lemma guarantees that $s$ can be split into three pieces, $s=xyz$, satisfying the three conditions of the lemma:
1. for each $ige0,xy^izin L,$
2. $|y|>0, and$
3. $|xy| le p.$
$x=a^s, y=a^t,z=a^p-s-tba^p$
for $i=0,$ $xy^0z in L$
I don't understand how to solve it.
Thanks.
automata regular-language pumping-lemma
The alphabet is $a, b$
Hi, I tried this:
Assume to the contrary that $L$ is regular. Let $p$ be the pumping length given by the pumping lemma. Let $s$ be the string $a^pba^p$. Because $s$ is a member of $L$ and $s$ has length more than $p$, the pumping lemma guarantees that $s$ can be split into three pieces, $s=xyz$, satisfying the three conditions of the lemma:
1. for each $ige0,xy^izin L,$
2. $|y|>0, and$
3. $|xy| le p.$
$x=a^s, y=a^t,z=a^p-s-tba^p$
for $i=0,$ $xy^0z in L$
I don't understand how to solve it.
Thanks.
automata regular-language pumping-lemma
asked Jul 18 at 15:26
Asaf
828
828
add a comment |Â
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2855680%2fprove-that-l-w-w-ends-with-a-palindrome-of-length-greater-than-or-equal%23new-answer', 'question_page');
);
Post as a guest
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
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
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