MHB Proving L is not Regular using Pumping Lemma

  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Regular
AI Thread Summary
The language L = {ww^R | w ∈ {0, 1}^*} is being analyzed for regularity using the pumping lemma. The discussion confirms that if L is regular, a DFA M would accept the string 0^k110^k, leading to the conclusion that the string can be expressed as xyz, where y is non-empty. It is emphasized that the pumping lemma guarantees that all strings of the form xy^iz for i ≥ 1 must also belong to L. To derive a contradiction, it is necessary to examine cases for the content of y, particularly focusing on its position within the string. The conversation clarifies that y must be in the first zeros portion, simplifying the analysis.
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.
 

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