retagged by
338 views
1 votes
1 votes
Suppose there are two FA's F1 and F2  and given that  L(F1) = L(F2) then it means F1 and F2 are same .
retagged by

Please log in or register to answer this question.

Related questions

3 votes
3 votes
1 answer
1
logan1x asked May 10, 2019
1,106 views
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?
0 votes
0 votes
1 answer
2
goluabhinan asked Sep 11, 2018
786 views
Consider the regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is ____________.
0 votes
0 votes
2 answers
3