1 1 vote 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 & Architecture theory-of-computation finite-automata regular-language + – Sunil8860 563 views answer comment Share Follow Print See 1 comment 1 1 comment reply prateekdwv commented Aug 16, 2017 reply Follow flag 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 1 replyShare Please log in or register to add a comment.
