"finduv.txt" finds candidates pairs [u,v] where u and v are pullback functions in F1(a,b1,b2,c,u,v).

"GetOrb.txt" divides all candidate pairs into orbits which reduces a lot of work.

"MatchExp1.txt" matches two generalized-exponents sets.

"F1.txt" returns the minimal operator of F1(a,b1,b2,c,u,v) with u and v are in C(x)

"Case1.txt" and "case2.txt" finds F1-type solutions with different cases which depends on the relations of u and v in F1, which are two pullback functions.

"Eg.mw" is an example showing how to compute a F1-type solution of  a given order 3 operator.