Complexity of quantum uniform and nonuniform automata, DLT'2005, vol.3572, pp.78-87, 2005. ,
Very narrow quantum OBDDs and width hierarchies for classical OBDDs, Lobachevskii Journal of Mathematics, vol.37, issue.6, pp.670-682, 2016. ,
Randomization and nondeterminism are incomparable for ordered read-once branching programs, ECCC, issue.021, 1997. ,
On the computational power of probabilistic and quantum branching program, Information and Computation, vol.203, issue.2, pp.145-162, 2005. ,
Very narrow quantum OBDDs and width hierarchies for classical OBDDs, Descriptional Complexity of Formal Systems, vol.8614, pp.53-64, 2014. ,
On the power of randomized branching programs, ICALP. LNCS, vol.1099, pp.348-356, 1996. ,
Two-way finite automata with quantum and classical states, Theoretical Computer Science, vol.287, issue.1, pp.299-311, 2002. ,
Automata and quantum computing, 2015. ,
On a conjecture by Christian Choffrut, Int. J. Found. Comput. Sci, vol.28, issue.5, pp.483-502, 2017. ,
Affine computation and affine automaton, Computer Science-Theory and Applications, vol.9691, pp.146-160, 2016. ,
Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations, STACS. LNCS, vol.1200, pp.117-128, 1997. ,
Comparative complexity of quantum and classical OBDDs for total and partial functions, Russian Mathematics, vol.59, issue.11, pp.26-35, 2015. ,
Nondeterministic unitary OBDDs, Computer Science-Theory and Applications, vol.10304, pp.126-140, 2017. ,
On the computational power of affine automata, Language and Automata Theory and Applications, vol.10168, pp.405-417, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01908682
Lower bounds for Las Vegas automata by information theory, RAIRO-Theoretical Informatics and Applications, vol.37, issue.1, pp.39-49, 2003. ,
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata, Information and Computation, vol.169, issue.2, pp.284-296, 2001. ,
On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs, Lobachevskii Journal of Mathematics, vol.37, issue.6, pp.682-703, 2016. ,
Reordering method and hierarchies for quantum and classical ordered binary decision diagrams, Computer Science-Theory and Applications, vol.10304, 2017. ,
On quantum and probabilistic communication: Las Vegas and one-way protocols, STOC'00, pp.644-651, 2000. ,
, Communication complexity, 1997.
Quantum automata and quantum grammars, Theoretical Computer Science, vol.237, issue.1-2, pp.275-306, 2000. ,
Quantum vs. classical read-once branching programs, Complexity of Boolean Functions. No. 06111 in Dagstuhl Seminar Proceedings, Internationales Begegnungs und Forschungszentrum für Informatik, 2006. ,
Quantum branching programs and space-bounded nonuniform quantum complexity, Theoretical Computer Science, vol.334, issue.1, pp.177-225, 2005. ,
A read-once lower bound and a (1,+ k)-hierarchy for branching programs, Theoretical Computer Science, vol.238, issue.1, pp.347-362, 2000. ,
Quantum finite automata: A modern introduction, Computing with New Resources. LNCS, vol.8808, pp.208-222, 2014. ,
Language recognition power and succinctness of affine automata, Natural Computing DOI ,
Language recognition power and succinctness of affine automata, Unconventional Computation and Natural Computation, vol.9726, pp.116-129, 2016. ,
Branching Programs and Binary Decision Diagrams: Theory and Applications, 2000. ,