LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
minimization_of_state_machines [2008/09/24 09:58]
vkuncak
minimization_of_state_machines [2008/09/24 09:58]
vkuncak
Line 61: Line 61:
  
 Consequently,​ $Q^2 \setminus \nu$ is the equivalence relation. ​ From the definition of this equivalence it follows that if two states are equivalent, then so is the result of applying $\delta$ to them.  Therefore, we have obtained a well-defined deterministic automaton. Consequently,​ $Q^2 \setminus \nu$ is the equivalence relation. ​ From the definition of this equivalence it follows that if two states are equivalent, then so is the result of applying $\delta$ to them.  Therefore, we have obtained a well-defined deterministic automaton.
 +
  
  
Line 71: Line 72:
 Construct automaton recognizing Construct automaton recognizing
   * language {=,<​nowiki><​=</​nowiki>​}   * language {=,<​nowiki><​=</​nowiki>​}
-  * language {=,<​=,<​nowiki>​==</​nowiki>​}+  * language {=,<​nowiki>​<=</​nowiki>​,<​nowiki>​==</​nowiki>​}
 Minimize the automaton. Minimize the automaton.