| Computational Limitations Of Affine Automata And Generalized Affine Automata | 0 | 0.34 | 2021 |
| Computational Limitations Of Affine Automata And Generalized Affine Automata (Jan, 10.1007/S11047-020-09815-1, 2021) | 0 | 0.34 | 2021 |
| New Results On Vector And Homing Vector Automata | 0 | 0.34 | 2019 |
| The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. | 0 | 0.34 | 2019 |
| New results on classical and quantum counter automata | 0 | 0.34 | 2019 |
| Alternating, private alternating, and quantum alternating realtime automata | 0 | 0.34 | 2019 |
| Postselecting probabilistic finite state recognizers and verifiers. | 0 | 0.34 | 2018 |
| New Size Hierarchies for Two Way Automata. | 0 | 0.34 | 2018 |
| Probabilistic verification of all languages. | 0 | 0.34 | 2018 |
| Exact Affine OBDDs. | 0 | 0.34 | 2017 |
| Inkdots as advice for finite automata. | 0 | 0.34 | 2017 |
| Nondeterministic Unitary Obdds | 0 | 0.34 | 2017 |
| Exact Affine Counter Automata | 0 | 0.34 | 2017 |
| Uncountable Realtime Probabilistic Classes | 1 | 0.37 | 2017 |
| On A Conjecture By Christian Choffrut | 0 | 0.34 | 2017 |
| On the computational power of affine automata. | 0 | 0.34 | 2017 |
| Looking For Pairs That Hard To Separate: A Quantum Approach | 1 | 0.34 | 2016 |
| Two-way frequency finite automata. | 0 | 0.34 | 2016 |
| Language recognition power and succintness of affine automata. | 0 | 0.34 | 2016 |
| Decision Problems on Unary Probabilistic and Quantum Automata | 0 | 0.34 | 2016 |
| Can one quantum bit separate any pair of words with zero-error? | 3 | 0.44 | 2016 |
| Affine computation and affine automaton. | 3 | 0.47 | 2016 |
| Uncountable classical and quantum complexity classes. | 1 | 0.37 | 2016 |
| Automata and Quantum Computing | 7 | 0.59 | 2015 |
| On discerning strings with finite automata | 1 | 0.37 | 2015 |
| Inkdots as advice to small-space machines | 0 | 0.34 | 2015 |
| Classical Automata on Promise Problems. | 10 | 0.53 | 2015 |
| Unary probabilistic and quantum automata on promise problems. | 3 | 0.38 | 2015 |
| Debates With Small Transparent Quantum Verifiers | 0 | 0.34 | 2014 |
| Classical and quantum counter automata on promise problems. | 3 | 0.37 | 2014 |
| Magic coins are useful for small-space quantum machines. | 4 | 0.52 | 2014 |
| More on quantum, stochastic, and pseudo stochastic languages with few states | 5 | 0.51 | 2014 |
| Classical and quantum realtime alternating automata. | 3 | 0.42 | 2014 |
| The Complexity of Debate Checking. | 1 | 0.37 | 2014 |
| Finite state verifiers with constant randomness | 0 | 0.34 | 2014 |
| Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs. | 11 | 0.57 | 2014 |
| The Minimum Amount of Useful Space: New Results and New Directions. | 2 | 0.41 | 2014 |
| Log-space counter is useful for unary languages by help of a constant-size quantum register. | 1 | 0.35 | 2013 |
| Finite Automata With Advice Tapes | 2 | 0.37 | 2013 |
| Non-trivial unary languages recognized by two-way one-counter machines. | 1 | 0.39 | 2013 |
| Quantum Alternation. | 0 | 0.34 | 2013 |
| Tight Bounds For The Space Complexity Of Nonregular Language Recognition By Real-Time Machines | 5 | 0.56 | 2013 |
| Probabilistic verifiers for asymmetric debates | 1 | 0.43 | 2012 |
| One-Counter Verifiers for Decidable Languages. | 3 | 0.46 | 2012 |
| Superiority of one-way and realtime quantum machines. | 4 | 0.46 | 2012 |
| Turing-equivalent automata using a fixed-size quantum memory | 3 | 0.40 | 2012 |
| Public-qubits versus private-coins. | 7 | 0.48 | 2012 |
| Exact quantum algorithms for promise problems in automata theory | 0 | 0.34 | 2011 |
| Classical and quantum computation with small space bounds (PhD thesis) | 4 | 0.43 | 2011 |
| Superiority of one-way and realtime quantum machines and new directions (extended abstract) | 0 | 0.34 | 2011 |
