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 . CO and Architecture theory-of-computation finite-automata regular-language + – Sunil8860 asked Aug 16, 2017 retagged Jul 5, 2019 by Cristine Sunil8860 338 views answer comment Share Follow See 1 comment See all 1 1 comment reply prateekdwv commented Aug 16, 2017 reply Follow Share Not necessary same, but similar. There can be different FA accepting same regular language. However, there is only one uniuqe minimised DFA accepting a regular language. Thus, if $L_1$ and $L_2$ are minimised DFA of same regular language, then they are certainly same (exactly). 1 votes 1 votes Please log in or register to add a comment.