edited by
360 views

1 Answer

Best answer
1 votes
1 votes
Given,

$∑$ = { $a, b$}

$L(A)$ = { $x $ $|$  if $x ∊ L(A)$  then $u ∊ L(A)$ for $∃u,v∊∑^{∗}$  where $x = uv $ }

From the given condition, as $v$ contain  $\varepsilon$  then $x = u$ and its satisfy all condition ie. if $x ∊ L(A)$  then $u ∊ L(A)$

Therefore,

$L(A)$ $ = (a + b)^{*}$

So, number of final states = $1$
selected by

Related questions

3 votes
3 votes
1 answer
2
1 votes
1 votes
1 answer
3
kislaya Pant asked May 8, 2018
1,066 views
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....
1 votes
1 votes
1 answer
4
dd asked Sep 20, 2016
1,326 views
How many final states required in the equivalent DFA ?