1. F. Ablayev, “Randomization and nondeterminsm are incomparable for ordered read-once branching programs,” Electronic Colloquium on Computational Complexity 4 (21), (1997).
2. F. Ablayev and A. Gainutdinova, “Complexity of quantum uniform and nonuniform automata,” Developments in Language Theory, LNCS 3572, 78–87 (2005).
3. F. Ablayev, A. Gainutdinova, and M. Karpinski, “On computational power of quantum branching programs,” FCT, LNCS 2138, 59–70 (2001).
4. F. M. Ablayev, A. Gainutdinova, and M. Karpinski, Cristopher Moore, and Chris Pollett, “On the computational power of probabilistic and quantum branching program,” Information Computation 203 (2), 145–162 (2005).
5. F. M. Ablayev and M. Karpinski, “On the power of randomized branching programs,” ICALP, LNCS 1099, 348–356 (1996).