1,324 views
1 votes
1 votes

How many final states required in the equivalent DFA ?

1 Answer

Related questions

3 votes
3 votes
1 answer
3
Nishisahu asked Oct 8, 2021
360 views
A FA accepting language L(A) has n states and m transition. ∑ = {a, b}L(A) is given asL(A)={ x | if x ∊ L(A) then u ∊ L(A) for $∃u, v ∊ ∑^{*}$ where x=uv }Fin...
1 votes
1 votes
1 answer
4
kislaya Pant asked May 8, 2018
1,063 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)....