I have the following language L = {a(^i)b(^j)c(^k) | i, j, k ≥ 0, and, if i = 1 then j = k} . How do I use the fact that L′ = {ab(^i)c)^i) | i ≥ 0 to prove that is it not regular? I am given a hint that says that the regular languages are closed under the intersection operation, but quite honestly I have no idea what should be done.
Asked
Active
Viewed 25 times
0
-
Welcome to [cs.SE]! Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction. – D.W. Feb 08 '22 at 03:33
-
I don't understand what you mean by "How do I use the fact that L' = .."? Something seems missing. What fact did you have in mind? Please [edit] the question to clarify. – D.W. Feb 08 '22 at 03:33
-
There is a similar question here: https://cs.stackexchange.com/questions/148817/how-do-i-prove-a-language-is-not-regular-using-l-a-bi-ci-i-%e2%89%a5-0 – Doralisa Feb 08 '22 at 06:02
-
Does this answer your question? How do I prove a language is not regular using L′ = {a b^i c^i | i ≥ 0}? – John L. Feb 16 '22 at 16:33