Related references
Note: Only part of the references are listed.Computational Limitations of Affine Automata
Mika Hirvensalo et al.
UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION, UCNC 2019 (2019)
Language recognition power and succinctness of affine automata
Marcos Villagra et al.
NATURAL COMPUTING (2018)
Language recognition power and succinctness of affine automata
Marcos Villagra et al.
NATURAL COMPUTING (2018)
Error-Free Affine, Unitary, and Probabilistic OBDDs
Rishat Ibrahimov et al.
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018 (2018)
On a Conjecture by Christian Choffrut
Aleksandrs Belovs et al.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2017)
Nondeterministic Unitary OBDDs
Aida Gainutdinova et al.
COMPUTER SCIENCE - THEORY AND APPLICATIONS (CSR 2017) (2017)
Exact Affine Counter Automata
Masaki Nakanishi et al.
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE (2017)
On the Computational Power of Affine Automata
Mika Hirvensalo et al.
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2017) (2017)
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
F. Ablayev et al.
LOBACHEVSKII JOURNAL OF MATHEMATICS (2016)
On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs
K. Khadiev
LOBACHEVSKII JOURNAL OF MATHEMATICS (2016)
Affine Computation and Affine Automaton
Alejandro Diaz-Caro et al.
COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2016 (2016)
Comparative Complexity of Quantum and Classical OBDDs for Total and Partial Functions
A. F. Gainutdinova
RUSSIAN MATHEMATICS (2015)
On the computational power of probabilistic and quantum branching program
F Ablayev et al.
INFORMATION AND COMPUTATION (2005)
Quantum branching programs and space-bounded nonuniform quantum complexity
M Sauerhoff et al.
THEORETICAL COMPUTER SCIENCE (2005)
Two-way finite automata with quantum and classical states
A Ambainis et al.
THEORETICAL COMPUTER SCIENCE (2002)
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
J Hromkovic et al.
INFORMATION AND COMPUTATION (2001)
A read-once lower bound and a (1,+k)-hierarchy for branching programs
P Savicky et al.
THEORETICAL COMPUTER SCIENCE (2000)
Share Paper
