Because DFAs can be reduced to `` canonical form '' ( efficient DFAs ) , there are also minimal algorithms to determine : Because DFAs can be reduced to a `` canonical form '' ( efficient DFAs ) , there are also minimal algorithms to determine : Because DFAs can be reduced to `` canonical form '' ( minimal DFAs ) , there are also efficient algorithms to determine :