Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.


Math Forum
»
Discussions
»
sci.math.*
»
sci.math
Notice: We are no longer accepting new posts, but the forums will continue to be readable.
Topic:
Regular Language Proof Help
Replies:
1
Last Post:
Sep 30, 2013 9:07 PM



nilefan
Posts:
5
Registered:
1/30/13


Regular Language Proof Help
Posted:
Sep 30, 2013 5:28 PM


The question is: Is L' a regular language?
L' = {a^(n+2) b^(n2) : n >= 2, n ? Z}
Here is my proof, but I am not sure it is correct:
y = a^k x = a^q z = a^((p+2)qk) b^(p2)
xyyz = a^(q) a^(k) a^(k) a^((p+2)qk) b^(p2) = a^(k(p+2) b^(p2) ? L' Contradiction, L' is not regular.
Is this right?



