1 votes 1 votes Two finite state machines are said to be equivalent if they: Have the same number of edges Have the same number of states Recognize the same set of tokens Have the same number of states and edges Theory of Computation ugcnetcse-july2018-paper2 theory-of-computation finite-automata + – Pooja Khatri asked Jul 13, 2018 recategorized Oct 15, 2018 by Pooja Khatri Pooja Khatri 15.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Two finite state machine are said to be equivalent if, starting from their respective initial states, they will produce the same output sequence when they are given the same input sequence. That implies they must recognize the same set of tokens . Sayan Bose answered Jul 14, 2018 Sayan Bose comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Option (3) Recognize same set of tokens. shahidhope answered Jul 14, 2018 shahidhope comment Share Follow See all 0 reply Please log in or register to add a comment.