The Gateway to Computer Science Excellence
+2 votes
Let $L$ be a regular language and $w$ be a string in $L$. If $w$ can be split into $x, y$ and $z$ such that $|xy| \leq$ number of states in the minimal DFA for $L$, and $|y| > 0$ then,
(A) $\forall i \in N, xy^iz \notin L$

(B) $\exists i \in N, xy^iz \in L$

(C) $\forall i \in N, xy^iz \in L$

(D) $\exists i \in N, xy^iz \notin L$
in Theory of Computation by
retagged by | 278 views

1 Answer

+7 votes
Best answer
(C) $\forall i \in N, xy^iz \in L$

This is the result of Pumping Lemma for regular language
selected by
Why you say it is a condition? It is the result of pumping lemma rt?
Yes, result. I will correct the statement. Thanks.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,345 questions
60,471 answers
95,278 users