| Publication | Date of Publication | Type |
|---|
| GAPs for Shallow Implementation of Quantum Finite Automata | 2024-04-09 | Paper |
| Language recognition power and succinctness of affine automata | 2023-11-30 | Paper |
| Correction to: ``Computational limitations of affine automata and generalized affine automata | 2023-09-08 | Paper |
| Computational limitations of affine automata and generalized affine automata | 2023-09-08 | Paper |
| Exact Affine Counter Automata | 2023-08-15 | Paper |
| Error-Free Affine, Unitary, and Probabilistic OBDDs | 2023-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161152 | 2023-06-26 | Paper |
| Improved constructions for succinct affine automata | 2022-11-09 | Paper |
| Affine automata verifiers | 2022-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5016371 | 2021-12-13 | Paper |
| Automata and quantum computing | 2021-11-12 | Paper |
| The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints | 2020-10-28 | Paper |
| Error-free affine, unitary, and probabilistic OBDDs | 2020-06-30 | Paper |
| Classical and Quantum Counter Automata on Promise Problems | 2020-01-13 | Paper |
| Uncountable realtime probabilistic classes | 2019-12-19 | Paper |
| New Results on Vector and Homing Vector Automata | 2019-12-19 | Paper |
| Computational limitations of affine automata | 2019-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5232904 | 2019-09-13 | Paper |
| Uncountable classical and quantum complexity classes | 2019-07-18 | Paper |
| More on quantum, stochastic, and pseudo stochastic languages with few states | 2019-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560202 | 2018-12-10 | Paper |
| Unary probabilistic and quantum automata on promise problems | 2018-11-07 | Paper |
| New size hierarchies for two way automata | 2018-11-02 | Paper |
| On a Conjecture by Christian Choffrut | 2018-02-22 | Paper |
| Uncountable realtime probabilistic classes | 2017-08-31 | Paper |
| Nondeterministic unitary OBDDs | 2017-08-22 | Paper |
| Quantum alternation | 2017-06-30 | Paper |
| On the Computational Power of Affine Automata | 2017-06-01 | Paper |
| Looking for Pairs that Hard to Separate: A Quantum Approach | 2016-11-09 | Paper |
| Language Recognition Power and Succinctness of Affine Automata | 2016-09-28 | Paper |
| Affine Computation and Affine Automaton | 2016-07-25 | Paper |
| Debates with small transparent quantum verifiers | 2016-06-23 | Paper |
| New results on the minimum amount of useful space | 2016-06-23 | Paper |
| Computation with multiple CTCs of fixed length and width | 2016-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3455037 | 2015-12-03 | Paper |
| Unary probabilistic and quantum automata on promise problems | 2015-11-10 | Paper |
| Classical and Quantum Counter Automata on Promise Problems | 2015-09-23 | Paper |
| Quantum, Stochastic, and Pseudo Stochastic Languages with Few States | 2015-09-14 | Paper |
| Quantum Finite Automata: A Modern Introduction | 2015-09-08 | Paper |
| The complexity of debate checking | 2015-09-04 | Paper |
| FINITE AUTOMATA WITH ADVICE TAPES | 2015-04-23 | Paper |
| The Minimum Amount of Useful Space: New Results and New Directions | 2014-10-14 | Paper |
| Debates with Small Transparent Quantum Verifiers | 2014-10-14 | Paper |
| Implications of Quantum Automata for Contextuality | 2014-09-26 | Paper |
| Unary Languages Recognized by Two-Way One-Counter Automata | 2014-09-26 | Paper |
| Finite state verifiers with constant randomness | 2014-09-05 | Paper |
| Classical Automata on Promise Problems | 2014-08-07 | Paper |
| Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs | 2014-08-07 | Paper |
| TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES | 2014-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414546 | 2014-05-06 | Paper |
| Real-Time Vector Automata | 2013-08-16 | Paper |
| Finite Automata with Advice Tapes | 2013-06-28 | Paper |
| One-Counter Verifiers for Decidable Languages | 2013-06-14 | Paper |
| Quantum Alternation | 2013-06-14 | Paper |
| Proving the power of postselection | 2013-04-18 | Paper |
| Quantum counter automata | 2013-01-18 | Paper |
| Superiority of one-way and realtime quantum machines | 2012-11-22 | Paper |
| Quantum computation with devices whose contents are never read | 2012-11-15 | Paper |
| Finite state verifiers with constant randomness | 2012-08-14 | Paper |
| Superiority of exact quantum automata for promise problems | 2012-05-04 | Paper |
| A new family of nonstochastic languages | 2012-01-18 | Paper |
| Languages recognized by nondeterministic quantum finite automata | 2011-10-05 | Paper |
| Unbounded-error quantum computation with small space bounds | 2011-07-08 | Paper |
| Computation with Narrow CTCs | 2011-06-17 | Paper |
| Quantum computation with devices whose contents are never read | 2010-07-26 | Paper |
| Languages Recognized with Unbounded Error by Quantum Finite Automata | 2009-08-18 | Paper |
| Efficient probability amplification in two-way quantum finite automata | 2009-05-19 | Paper |
