The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
200 views
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$
asked in Theory of Computation by Veteran (359k points)
retagged by | 200 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
answered by Loyal (6.1k points)
selected by
0
Why you say it is a condition? It is the result of pumping lemma rt?
0
Yes, result. I will correct the statement. Thanks.


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

40,903 questions
47,558 answers
146,289 comments
62,306 users