Skip to main content
Computer Science

Return to Question

edited tags
Source Link
Raphael
Raphael
  • 72.9k
  • 30
  • 181
  • 393

I have a question to find out that $L = \{a^i b^{j+3}\mid i\ne j \}$ is regular or not. I know that it is not regular. I tried with pumping lemma but I am finding just a specific number of $v$'s in $u v^i w$ that not satisfies the language condition, but not ALL $v$'s. What are the best choices for $i$ and $j$ to prove with pumping lemma that this is not a regular language?

Thanks in advance.

I have a question to find out that $L = \{a^i b^{j+3}\mid i\ne j \}$ is regular or not. I know that it is not regular. I tried with pumping lemma but I am finding just a specific number of $v$'s in $u v^i w$ that not satisfies the language condition, but not ALL $v$'s. What are the best choices for $i$ and $j$ to prove with pumping lemma that this is not a regular language?

Thanks in advance.

I have a question to find out that $L = \{a^i b^{j+3}\mid i\ne j \}$ is regular or not. I know that it is not regular. I tried with pumping lemma but I am finding just a specific number of $v$'s in $u v^i w$ that not satisfies the language condition, but not ALL $v$'s. What are the best choices for $i$ and $j$ to prove with pumping lemma that this is not a regular language?

added 19 characters in body
Source Link
Rick Decker
Rick Decker
  • 14.9k
  • 5
  • 42
  • 54

I have a question to find out that L = {a^i b^(j+3)| i!=j }$L = \{a^i b^{j+3}\mid i\ne j \}$ is regular or not. I know that it is not regular. I tried with pumping lemma but I am finding just a specific number of v's$v$'s in u v^i w$u v^i w$ that not satisfies the language condition, but not ALL v's$v$'s. What are the best choices for i$i$ and j$j$ to prove with pumping lemma that this is not a regular language?

Thanks in advance.

I have a question to find out that L = {a^i b^(j+3)| i!=j } is regular or not. I know that it is not regular. I tried with pumping lemma but I am finding just a specific number of v's in u v^i w that not satisfies the language condition, but not ALL v's. What are the best choices for i and j to prove with pumping lemma that this is not a regular language?

Thanks in advance.

I have a question to find out that $L = \{a^i b^{j+3}\mid i\ne j \}$ is regular or not. I know that it is not regular. I tried with pumping lemma but I am finding just a specific number of $v$'s in $u v^i w$ that not satisfies the language condition, but not ALL $v$'s. What are the best choices for $i$ and $j$ to prove with pumping lemma that this is not a regular language?

Thanks in advance.

Source Link
Razvan
Razvan
  • 31
  • 7

Irregularity of L = {a^i b^(j+3)| i!=j }

I have a question to find out that L = {a^i b^(j+3)| i!=j } is regular or not. I know that it is not regular. I tried with pumping lemma but I am finding just a specific number of v's in u v^i w that not satisfies the language condition, but not ALL v's. What are the best choices for i and j to prove with pumping lemma that this is not a regular language?

Thanks in advance.