Equivalence between two automata

前端 未结 3 1605
抹茶落季
抹茶落季 2021-01-02 19:11

Which is the best or easiest method for determining equivalence between two automata?

I.e., if given two finite automata A and B, how can I determine whether both r

3条回答
  •  走了就别回头了
    2021-01-02 19:26

    Two nondeterministic finite automota (NFA's) are equivalent if they accept the same language.

    To determine whether they accept the same language, we look at the fact that every NFA has a minimal DFA, where no two states are identical. A minimal DFA is also unique. Thus, given two NFA's, if you find that their corresponding minimal DFA's are equivalent, then the two NFA's must also be equivalent.

    For an in-depth study on this topic, I highly recommend that you read An Introduction to Formal Language and Automata.

提交回复
热议问题