Differences

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

Link to this comparison view

Next revision
Previous revision
lfa:2023:lab05 [2023/11/06 17:09]
alexandra.udrescu01 created
lfa:2023:lab05 [2023/11/11 12:29] (current)
alexandra.udrescu01
Line 48: Line 48:
 States 0 and 5 are distinguishable because from 0 we can accept word "​b",​ but not from 5.</​note>​ States 0 and 5 are distinguishable because from 0 we can accept word "​b",​ but not from 5.</​note>​
 </​hidden>​ </​hidden>​
 +
  
  
Line 232: Line 233:
 Another more elegant approach is to use state equivalence. We can treat two (not necessarily minimal) DFAs as one and the same, and compute the (in)distinguishability table over all states, in a single go. Finally, the DFAs accept the same language iff their initial states are indistinguishable. Another more elegant approach is to use state equivalence. We can treat two (not necessarily minimal) DFAs as one and the same, and compute the (in)distinguishability table over all states, in a single go. Finally, the DFAs accept the same language iff their initial states are indistinguishable.
 </​note></​hidden>​ </​note></​hidden>​
 +
 +
  
  
Line 334: Line 337:
  
 </​note></​hidden>​ </​note></​hidden>​
 +
 +