The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+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 .
asked in CO & Architecture by (251 points) | 42 views
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).

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,156 questions
36,980 answers
34,822 users