MHB Proving L is not Regular using Pumping Lemma

  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Regular
mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

I want to prove that the language $$L=\{ww^R \mid w \in \{0, 1\}^{\star} \}$$ is not regular using the pumping lemma. I have done the following:

We suppose that $L$ is regular and is recognized by a DFA $M$ with $k$ states.
So, $M$ accepts the string $0^k110^k$.
Since $|0^k110^k|=2k+2>k$, there is a state $q$ through which $0^k110^k$ passes at least twice.
So, $0^k110^k$ is of the form $0^k110^k=xyz$, where $x$ leads $M$ from $q_0$ to $q$, $y$ leads $M$ from $q$ to $q$ (and $y \neq \varepsilon$) and $z$ leads $M$ from $q$ to an accepting state.
We suppose that $M$ accepts every string of the form $xy^iz, i \geq 1$.

Is the formulation until this point correct? Could I improve something? (Wondering)

To get a contradiction do we have to take cases for what $y$ contains? (Wondering)
 
Last edited by a moderator:
Physics news on Phys.org
mathmari said:
We suppose that $L$ is regular and is recognized by a DFA $M$ with $k$ states.
So, $M$ accepts the string $0^k110^k$.
Since $|0^k110^k|=2k+2>k$, there is a state $q$ through which $0^k110^k$ passes at least twice.
So, $0^k110^k$ is of the form $0^k110^k=xyz$, where $x$ leads $M$ from $q_0$ to $q$, $y$ leads $M$ from $q$ to $q$ (and $y \neq \varepsilon$) and $z$ leads $M$ from $q$ to an accepting state.
This is correct, but it is not necessary to invoke automata during an application of the pumping lemma. You don't want to prove it all over again.

mathmari said:
We suppose that $M$ accepts every string of the form $xy^iz, i \geq 1$.
It's not "suppose", it follows that it is the case. You could say, "Then the pumping lemma asserts that every string of the form $xy^iz, i \geq 1$ is in $L$".

mathmari said:
To get a contradiction do we have to take cases for what $y$ contains?
Yes, you need to consider the cases when $y$ is contained in the first zeros portion, second zeros portion and when it contains a 1. However, one variant of the pumping lemma says in addition that $|xy|\le k$ where $k$ is the pumping length, i.e., the constant whose existence is guaranteed by the lemma (it is equal to the number of states in the automaton, but, again, it is not necessary to mention it). Then it follows that $y$ is in the first zeros portion, which makes considering other cases unnecessary.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
18
Views
3K
Replies
3
Views
2K
Replies
5
Views
2K
Replies
3
Views
2K
Replies
1
Views
2K
Replies
10
Views
3K
Replies
13
Views
3K
Back
Top